An exact DSatur-based algorithm for the Equitable Coloring Problem
classification
💻 cs.DM
keywords
algorithmcoloringproblemequitableexactknownclassiccompetitive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.