One Color Preprocessing Improves DSATUR
This story is from 2026-09-17. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2609.17633v1 Announce Type: new Abstract: The Graph Coloring Problem (GCP) is NP-hard and DSATUR stands as one of the fastest heuristics for it despite producing colorings that typically use more colors than state-of-the-art coloring algorithms. We propose SSLD (Semidefinite Spectral Learning…
Read the full story at arXiv cs.AI ↗
Timeline · 1 report
- 2026-09-17 04:00 · arXiv cs.AI
One Color Preprocessing Improves DSATUR