frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Open in hackernews

The Fastest Way yet to Color Graphs

https://www.quantamagazine.org/the-fastest-way-yet-to-color-graphs-20250512/
62•GavCo•1y ago

Comments

tonyarkles•1y ago
In case you haven't looked at the article, this is looking specifically at the Edge Coloring problem and not the more commonly known Vertex Coloring problem. Vertex Coloring is NP-complete unfortunately.
erikvanoosten•1y ago
You can convert edge coloring problems into vertex coloring problems and vice versa through a simple O(n) procedure.
meindnoch•1y ago
Wrong. You can convert edge-coloring problems into vertex-coloring problems of the so-called line graph: https://en.m.wikipedia.org/wiki/Line_graph

But the opposite is not true, because not every graph is a line graph of some other graph.

erikvanoosten•1y ago
Indeed. Thanks, I stand corrected.
tonyarkles•1y ago
Hrm... right. It's been a while. And it looks like both Vertex Coloring and Edge Coloring are both NP-complete (because of the O(n) procedure you're talking about and the ability to reduce both problems down to 3-SAT). I've started looking closer at the actual paper to try to figure out what's going on here. Thanks for the reminder, I miss getting to regularly work on this stuff.

Edit: thanks sibling reply for pointing out that it's not a bidirectional transform.

mauricioc•1y ago
For the edge-coloring problem, the optimal number of colors needed to properly color the edges of G is always either Delta(G) (the maximum degree of G) or Delta(G) + 1, but deciding which one is the true optimum is an NP-complete problem.

Nevertheless, you can always properly edge-color a graph with Delta(G) + 1 colors. Finding such a coloring could in principle be slow, though: the original proof that Delta(G) + 1 colors is always doable amounted to a O(e(G) * v(G)) algorithm, where e(G) and v(G) denote the number of edges and vertices of G, respectively. This is polynomial, but nowhere near linear. What the paper in question shows is how, given any graph G, to find an edge coloring using Delta(G) + 1 colors in O(e(G) * log(Delta(G))) time, which is linear time if the maximum degree is a constant.

Syzygies•1y ago
Yes. The article ran through this point as follows:

"In 1964, a mathematician named Vadim Vizing proved a shocking result: No matter how large a graph is, it’s easy to figure out how many colors you’ll need to color it. Simply look for the maximum number of lines (or edges) connected to a single point (or vertex), and add 1."

I keep wondering why I ever read Quanta Magazine. It takes a pretty generous reading of "need" to make this a correct statement.

JohnKemeny•1y ago
phkahler•1y ago
Is this going to lead to faster compile times? Faster register allocation...
john-h-k•1y ago
Very few compilers actually use vertex coloring for register allocation
isaacimagine•1y ago
Totally. The hard part isn't coloring (you can use simple heuristics to get a decent register assignment), rather, it's figuring out which registers to spill (don't spill registers in hot loops! and a million other things!).
NooneAtAll3•1y ago
and this post isn't even about vertex coloring
DannyBee•1y ago
No.

In SSA, the graphs are chordal, so were already easily colorable (relatively).

Outside of SSA, this is not true, but the coloring is still not the hard part, it's the easy part.

Not really. Coloring a graph is almost always talking about proper coloring, meaning that things that objects that are related receive different colors.

If you read the introduction, you'll also read that the goal is to "color each of your lines and require that for every point, no two lines connected to it have the same color."

Ps. "How many colors a graph needs" is a very well established term in computer science and graph theory.

mockerell•1y ago
I think the comment referred to the phrase „a graph needs X (colors or whatever)“. For me, this can be read two ways: 1. „a graph always needs at least X colors“ or 2. „a graph always needs at most X colors“.

Personally, I would interpret this as option 1 (and so did the comment above I assume). In that case, the statement is wrong. But I’d prefer to specify „at most/ at least“ anyways.

Or even better, use actual vocabulary. „For every graph there exists a coloring with X colors.“ or „any graph can be coloured using X colors“.

PS: I also agree with the sentiment about quanta magazine. It’s hard to get some actual information from their articles if you know the topic.

JohnKemeny•1y ago
What about this statement:

No matter how large a car is, it is easy to figure out how much money you'll need to buy it. Simply look at the price tag.

(From: No matter how large a graph is, it’s easy to figure out how many colors you’ll need to color it. Simply look for the maximum ...)

mauricioc•1y ago
Parent's point is that sometimes (but not always) the store is perfectly fine selling you a car for $1 less than what the "price tag" of Delta(G)+1 dollars asks for, so "need" is a bit inaccurate.

GPT‑6.2 Astra and Sol

https://openai.com/index/introducing-gpt-6-2-astra-sol/
871•jasondavies•3h ago•529 comments

jQuery 4.1.0

https://github.com/jquery/jquery/releases/tag/4.1.0
151•petecooper•1h ago•65 comments

MAI Code 2 and Code 2 Flash

https://microsoft.ai/news/introducing-mai-code-2-and-mai-code-2-flash/
200•lemonish97•3h ago•97 comments

350 years ago, Ole Rømer discovered that light has a finite speed

https://www.sciencenorway.no/culture-history-history-of-science/350-years-ago-this-man-discovered...
136•dxs•2h ago•38 comments

Nvidia stopped disclosing Singapore sales as revenues hit $104B

https://www.ft.com/content/dbde7a30-548c-4f9d-a4be-7898a0c24dcf
214•louiereederson•4h ago•114 comments

Web Browser Engineering (2021)

https://browser.engineering/
71•ibobev•1h ago•8 comments

Phrack 73 Released

https://phrack.org/issues/73/introduction_md
159•notmine1337•3h ago•7 comments

Java4Shell: RCE in OpenJDK when processing Base64

https://calif.io/java4shell/
34•werrett•30m ago•5 comments

Highly classified US national security communications network goes down

https://www.cnn.com/2026/11/17/politics/highly-classified-national-security-communications-networ...
336•monkeydust•6h ago•471 comments

Solid 2.0

https://www.solidjs.com/blog/solid-2-0-the-long-hold/
135•pier25•2h ago•33 comments

Java4Shell: pre-auth RCE flaw in Java 17 puts servers at risk (CVE-2026-114938)

https://www.aikido.dev/blog/java-17-rce-vulnerability-cve-2026-114938
57•b33f•6h ago•15 comments

Apple Services Down

https://developer.apple.com/system-status/
523•willy_k•3h ago•283 comments

What is the best harness for each model?

https://runta.com/blog/introducing-frontierharness-eval-v1-1/
293•Edward40•6h ago•103 comments

Effects of a Nuclear Detonation in Low Earth Orbit

https://arxiv.org/abs/2611.09827
28•PaulHoule•1h ago•10 comments

YC wrote software to run our internship expo – and an 8-bit SIM to show it off

1•ryankicks•4h ago

Launch HN: StarSling (YC P25) – Self-improving CI for agent-volume repos

https://starsling.dev
31•yonasb•2h ago•13 comments

Who Builds the Machines That Build the Machines?

https://read.corematter.com/p/section-232-us-machine-tools
54•gmays•3h ago•15 comments

Mouse Party

https://aboard.com/lets-have-a-mouse-party/
27•bookofjoe•3d ago•4 comments

Show HN: Alloy CSS, dialogs, menus and tabs that work with JavaScript off

https://alloyhtml.com/example.html
157•prafandy•6h ago•26 comments

Show HN: TrnRT – An open-source LLM inference engine for AWS Trainium

https://github.com/RunanywhereAI/trnrt
34•sanchitmonga22•5h ago•5 comments

New Evidence Shows School Phone Bans Are Gradually Improving Test Scores

https://www.nytimes.com/2026/11/17/upshot/school-phone-bans-study-scores.html
1073•donohoe•9h ago•534 comments

How the Claude Code team thinks about verification

https://claude.dev/blog/how-the-claude-code-team-thinks-about-verification/
228•craigmart•11h ago•178 comments

Zoltraak and the Dynamics of Military Innovation

https://jgeekstudies.org/2026/11/15/zoltraak-military-innovation-in-frieren/
7•zdw•1d ago•0 comments

Fixing a WebKit bug to see if promises are made of train tracks

https://alistair.sh/thenables
18•dverlaeckt80•3d ago•1 comments

Advancing computer-use agents for healthcare teams

https://openai.com/index/advancing-computer-use-for-healthcare-teams/
22•gmays•3h ago•15 comments

Purism Launches Librem 5 v2, a RISC-V Phone to Empower People

https://puri.sm/posts/purism-launches-librem-5-v2-a-risc-v-phone-to-empower-people/
77•gnufx•3h ago•65 comments

First Photos of the Poles of a Rod-Shaped Bacterium

https://nautil.us/check-out-the-first-photos-of-the-poles-of-a-rod-shaped-bacterium-1286664
104•dustfinger•1d ago•23 comments

Elephant-Goldfish Model

https://egm.dev/
54•_tk_•1d ago•21 comments

Not Everything Needs an LLM

https://newsletter.posthog.com/p/decision-models
23•speckx•3h ago•2 comments

VisualBasic.World: A gallery of Planet Source Code programs from 1997 to 2012

https://visualbasic.world/
200•broast•1d ago•76 comments