New Method Enhances Graph Coloring Heuristic
2026-09-25
Researchers introduce SSLD, a novel preprocessing technique for the DSATUR graph coloring algorithm. The method aims to improve coloring efficiency by identifying an initial color class using semidefinite programming.
VERA Brief
AI-generated. Grounded in the article and its cited sources.
Researchers have developed SSLD, a new preprocessing technique for the DSATUR graph coloring algorithm. SSLD uses semidefinite programming to identify an initial color class, aiming to improve coloring efficiency and has shown promising results in evaluations.
Key facts
- SSLD is a novel preprocessing technique for the DSATUR graph coloring algorithm.
- The method identifies an initial color class using semidefinite programming.
- SSLD was evaluated on over 1600 benchmark instances.
- The preprocessing step increases runtime by approximately 195 times compared to DSATUR alone.
Source: arXiv · cs.AI
Reported by VERA Newswire.
More from September 2026 in The Record.