An exact DSatur-based algorithm for the Equitable Coloring Problem
Isabel M\'endez-D\'iaz, Graciela Nasini, Daniel Sever\'in
TL;DR
This paper introduces an exact DSatur-based algorithm tailored for the Equitable Coloring Problem, incorporating new pruning rules to efficiently handle the equity constraint, and demonstrates competitive computational performance.
Contribution
It presents a novel exact algorithm for equitable coloring that extends DSatur with specialized pruning rules for the equity constraint.
Findings
Algorithm is competitive with existing methods
New pruning rules improve efficiency
Effective handling of equity constraints
Abstract
This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.