Abstract
In this paper we propose a method for integrating constraint propagation algorithms into an optimization procedure for vertex coloring with the goal of finding improved lower bounds. The key point we address is how to get instances of Constraint Satisfaction Problems (CSPs) from a graph coloring problem in order to give rise to new lower bounds outperforming the maximum clique bound. More precisely, the algorithms presented have the common goal of finding CSPs in the graph for which infeasibility can be proven. This is achieved by means of constraint propagation techniques which allow the algorithms to eliminate inconsistencies in the CSPs by updating domains dynamically and rendering such infeasibilities explicit. At the end of this process we use the largest CSP for which it has not been possible to prove infeasibility as an input for an algorithm which enlarges such CSP to get a feasible coloring. We experimented with a set of middle-high density graphs with quite a large difference between the maximum clique and the chromatic number.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Babel, L., (1991). “Finding Maximum Cliques in Arbitrary and in Special Graphs.” Computing 46, 321–341.
Balas, E. and J. Xue. (1996). “Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring.” Algoritmica 15(5), 397–412.
Baptiste, P., C. Le Pape, and W. Nuijten. (1995). “Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling.” In Proceedings of theFirst International JointWorkshop on Artificial Intelligence and Operations Research, Timberline Lodge, Oregon.
Caramia, M. (2000). “Coloring Algorithms and Their Application to Project Scheduling.” Ph.D. Thesis, University of Rome “La Sapienza”.
Caramia, M. and P. Dell'Olmo. (1999). “A Fast and Simple Local Search for Graph Coloring.” In Proc. of the 3rd Workshop on Algorithm Engineering (WAE'99), Lecture Notes in Computer Science, Vol. 1668, pp. 319–333.
Caramia, M. and P. Dell'Olmo. (2001a). “Iterative Coloring Extension of a Maximum Clique.” Naval Research Logistics 48(6), 518–550.
Caramia, M. and P. Dell'Olmo. (2001b). “A Lower Bound on the Chromatic Number of Mycielski Graphs.” Discrete Mathematics 235, 79–86.
Caramia, M., P. Dell'Olmo. and G.F. Italiano. (1999). “Tuning the Cache Performance of a Local Search Graph Coloring Algorithm.” Technical Report No. 389, Centro Vito Volterra, University of Rome “Tor Vergata”.
Caramia, M., P. Dell'Olmo. and G.F. Italiano. (2000). “CHECKCOL: Improved Local Search for Graph Coloring.” submitted.
Cooper, M.C. (1997). “Fundamental Properties of Neighborhood Substitution in Constraint Satisfaction Problems.” Artificial Intelligence 90, 1–24.
Dechter, R. and J. Pearl. (1988). “Network-Based Heuristics for Constraint-Satisfaction Problems.” Artificial Intelligence 34, 1–38.
DIMACS ftp site for benchmark graphs, ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/color/.
DIMACS ftp site for benchmark machines, ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/volume/ machine.
Fleurent, C. and J.A. Ferland. (1995). “Genetic and Hybrid Algorithms for Graph Coloring.” Annals of Operations Research 63, 437–461.
Fleurent, C. and J.A. Ferland. (1996). “Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability.” In D.S. Johnson and M.A. Trick (eds.), DIMACS Series on Discrete Mathematics and Theoretical Computer Science, AMS, Vol. 26, pp. 619–652.
Freuder, E.C. (1989). “A Sufficient Condition of the Backtrack Free Search.” J. ACM 29, 24–32.
Gardner, M. (1969). The Unexpected Hanging and Other Mathematical Diversions. New York: Simon and Schuster.
Garey, M.R. and D.S. Johnson, (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco: W.H. Freeman &;; Company.
Garey, M.R. and D.S. Johnson, and L. Stockmeyer. (1976) “Some Simplified NP-Complete Graph Problems.” Theor. Comput. Sci. 1, 237–267.
Gondran, M. and M. Minoux. (1984). Graphs and Algorithms. New York: John Wiley and Sons.
Johnson, D.S, C.R. Aragon, L.A. McGeoch, and C. Schevon. (1991). “Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning.” Operations Research 39, 378–406.
Kratochvil, J. (1993). “Precoloring Extension with Fixed Color Bound.” Acta Math. Univ. Comenianae 2, 139–153.
Mackworth, A.K. (1976). “Consistency in Networks of Relations.” Artificial Intelligence 8, 99–118.
Mehrotra, A. and M.A. Trick. (1996). “A Column Generation Approach for Graph Coloring.” INFORMS J. on Computing 8, 344–354.
Morgenstern, C. (1996). “Distributed Coloration Neighborhood Search.” In D.S. Johnson and M.A. Trick (eds.), DIMACS Series in Computer Mathematics and Theoretical Computer Science, AMS, Vol. 26, pp. 335–358.
Mycielski, J. (1955). “Sur le Coloriage des Graphes.” Colloquim Mathematiques 3, 161–162.
Sager T.J. and S. Lin. (1993). “A Pruning Procedure for Exact Graph Coloring.” ORSA J. Computing 3, 226–230.
Sewell, E.C. (1996). “An Improved Algorithm for Exact Graph Coloring.” In D.S. Johnson and M.A. Trick (eds.), DIMACS Series in Computer Mathematics and Theoretical Computer Science, AMS, Vol. 26, pp. 359–373.
Tutte, W.T. (1954). (B. Descartes) “Solution of Advances Problem No. 4526.” Advanced Mathematical Monthly 61, p. 352.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Caramia, M., Dell'Olmo, P. Constraint Propagation in Graph Coloring. Journal of Heuristics 8, 83–107 (2002). https://doi.org/10.1023/A:1013665718444
Issue Date:
DOI: https://doi.org/10.1023/A:1013665718444