One color preprocessing improves DSATUR
Read the original at arxiv.org→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...
Original headline: "One Color Preprocessing Improves DSATUR"
Coverage timeline
- Sep 17, 04:00 UTC arXiv cs.AI lead source One Color Preprocessing Improves DSATUR