One Color Preprocessing Improves DSATUR
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...
Read more: https://arxiv.org/abs/2609.17633
Scan with your phone
Scan with your phone