A DSATUR-based algorithm for the Equitable Coloring Problem
Discrete Mathematics
2017-10-27 v2 Combinatorics
Abstract
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSatur algorithm for the classic Coloring Problem, a new pruning criterion arising from equity constraints is proposed and analyzed. The good performance of the algorithm is shown through computational experiments over random and benchmark instances.
Keywords
Cite
@article{arxiv.1306.1758,
title = {A DSATUR-based algorithm for the Equitable Coloring Problem},
author = {Isabel Méndez-Díaz and Graciela Nasini and Daniel Severin},
journal= {arXiv preprint arXiv:1306.1758},
year = {2017}
}