| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652050 | Electronic Notes in Discrete Mathematics | 2013 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
