Brief
A preprocessing step sharpens a classic graph-coloring heuristic, at a steep runtime cost
A preprint reports that feeding one semidefinite-programming-chosen color class into DSATUR improves coloring quality on most of over 1,600 test instances, while running roughly 195 times slower than DSATUR alone. The result is a preprint claim about a trade-off, not a settled improvement.
SSLD adds a step before DSATUR starts: a semidefinite program, similar to one used to compute the Lovász theta number, picks a single color class, and DSATUR colors what remains. The authors describe it as the first approach to improve DSATUR by preprocessing through fixed color classes.
The evaluation covered over 1,600 instances: DIMACS benchmarks, random graphs (Erdős–Rényi, Watts–Strogatz, Barabási–Albert), frequency assignment and job shop scheduling. SSLD matched or beat DSATUR in almost every case and outperformed a naive one-color-class baseline, which the authors read as evidence that the SDP-guided choice of the first class is what helps.
The same quality carries a price the authors state plainly: roughly 195 times slower than DSATUR. They frame the work as pointing to a direction for future improvement rather than as a finished replacement.
Our reading
For readers of this desk, this is a well-bounded methods result: the measured claim (better colorings on most benchmarks) is separated from the authors' broader framing (a promising direction). It matters to anyone who uses heuristics for scheduling or assignment problems, where a 195-fold slowdown may outweigh modest gains in coloring quality.
What to do or watch
Watch whether the runtime cost can be cut before this becomes practical, and whether independent groups reproduce the quality gain on instances outside the benchmark set.
Source details and supporting facts
Each line is stated by the page named above it.
Stated by arXiv
- SSLD improves DSATUR by preprocessing a first good color class, obtained from a Semidefinite Programming step similar to an SDP used to compute the Lovász theta number.
- SSLD was evaluated on DIMACS instances, random graphs (Erdős–Rényi, Watts–Strogatz, Barabási–Albert), Frequency Assignment and Job Shop Scheduling instances.
- SSLD matches or beats DSATUR in almost every case across over 1600 benchmark instances.
- The quality comes at a runtime cost of roughly 195 times slower than DSATUR.
Sources
- arXivText stored 17 September 2026
How this story was checked. Written from the 1 page listed above, stored 17 September 2026; claims checked against that stored text on 17 September 2026.
What that means
- 4 of 5 reported statements were confirmed against the page that carries them; the rest were removed rather than published.
- Figures in the text were required to appear in the stored source text: yes. Identifiers: yes.
- The check reads stored text only: no claim rests on a fresh look that did not happen.
- Where the reporting was silent, the text says so instead of filling the gap.