Journal
DISCRETE APPLIED MATHEMATICS
Volume 154, Issue 5, Pages 826-847Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2005.05.022
Keywords
Graph Coloring; integer programming; Branch-and-Cut algorithms
Categories
Ask authors/readers for more resources
In this paper a Branch-and-Cut algorithm, based on a formulation previously introduced by us, is proposed for the Graph Coloring Problem. Since colors are indistinguishable in graph coloring, there may typically exist many different symmetrical colorings associated with a same number of colors. If solutions to an integer programming model of the problem exhibit that property, the Branch-and-Cut method tends to behave poorly even for small size graph coloring instances. Our model avoids, to certain extent, that bottleneck. Computational experience indicates that the results we obtain improve, in most cases, on those given by the well-known exact solution graph coloring algorithm Dsatur. (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available