arxiv
PublishedSeptember 17, 2026 at 4:00 AM
—neutral
One Color Preprocessing Improves DSATUR
Publisher summary· verbatim
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
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivImitation Learning for Autonomous Driving in CARLA2harxivFairCompressAgent: An Agentic Framework for Fairness-Aware Model Compression for FPGA Deployment2harxivA Four-Stage Decomposition of Word-Problem Solving and Mechanistic Fragility in LLM Math Reasoning2harxivLearning Heterogeneous Preferences2hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗