A new DSATUR-based algorithm for exact vertex coloring

Computers and Operations Research

Volumn 39, Issue 7, 2012, Pages 1724-1733

  San Segundo, Pablo ^a  

^a CENTRE FOR AUTOMATION AND ROBOTICS   (Spain)

Author keywords

Color; DSATUR; Exact; Graph

Indexed keywords

DSATUR; EXACT; EXACT ALGORITHMS; GRAPH; MAXIMUM DEGREE; NEW STRATEGY; RANDOM GRAPHS; SATURATION DEGREE; SYSTEMATIC EXPERIMENT; TIE-BREAKING; VERTEX COLORING; VERTEX COLORING PROBLEMS;

ALGORITHMS;

COLOR;

EID: 81555219444     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.10.008     Document Type: Article

References (31)

1. M. Garey., and D. Johnson Computers and intractability: a guide to the theory of NP completeness 1979 Freeman San Francisco, California
2. Fred C. Chow, and Hennessy John L. The priority-based coloring approach to register allocation ACM Trans. Program. Lang. Syst. 12 4 1990 501 536
3. N. Zufferey, P. Amstutz, and P. Giaccari. Graph coloring approaches for a satellite range scheduling problem Journal of Scheduling 11 4 2008 263 277
4. M. Gamache, A. Hertz, and J.O. Ouellet. A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding Computers & Operations Research 34 8 2007 2384 2395 (Pubitemid 46073429)
5. F.T. Leighton., and A. Graph Coloring algorithm for large scheduling problems Journal of Research of the National Bureau of Standards 84 6 1979 489 506
6. Barnier N, Brisset Graph P. Coloring for air traffic flow management. In: Proceedings of the CPAIOR02 fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems. Le Croisic, France; 2002. p. 13347.
7. D. Brélaz New methods to color the vertices of a graph Communications of the ACM 22 4 1979 251 256 (Pubitemid 9452014)
8. Bollobás B., Thomason A. Random graphs of small order. Random graphs 83. Annals of discrete mathematics, vol. 28, Section 6. North-Holland Publishing Co.; 1985. p. 4797.
9. Culberson J. Iterated greedy graph coloring and the difficulty landscape. Technical Report 92-07. Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada; 1992.
10. A. Hertz, and D. de Werra Using tabu search techniques for graph coloring Computing 39 4 1987 345 351 (Pubitemid 18562739)
11. D.D. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning Operations Research 39 1991 378 406
12. Morgenstern CA. Distributed coloration neighborhood search. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability: 2nd DIMACS. Implementation Challenge, 1993. DIMACS series in discrete mathematics and theoretical computer science. American Mathematical Society; 1996. p. 33558.
13. N. Funabiki, and T. Higashino A minimal-state processing search algorithm for graph coloring problems IEICE Transactions on Fundamentals E83-A 2000 1420 1430
14. Fleurent C, Ferland J. Object-oriented implementation of heuristics search methods for graph coloring, maximum clique, and satisfiability. DIMACS series in discrete mathematics and theoretical computer science. American Mathematical Society, vol. 26; 1996. p. 61952.
15. P. Galinier, and J.K. Hao Hybrid evolutionary algorithms for graph coloring Journal of Combinatorial Optimization 3 1999 379 397 (Pubitemid 129575323)
16. I. Blöchliger, and N. Zufferey. A reactive tabu search using partial solutions for the graph coloring problem Computers & Operations Research 35 2008 960 975 (Pubitemid 47368857)
17. E. Malaguti, M. Monaci, P. Toth., and A. Metaheuristic Approach for the vertex coloring problem Informs Journal of Computing 20 2 2008 302 316
18. E. Malaguti, and P. Toth. A survey on vertex coloring problems International Transactions in Operational Research 17 1 2010 1 34
19. I. Mendez-Diaz, and P. Zabala. A branch-and-cut algorithm for graph coloring Discrete Applied Mathematics 154 5 2006 826 847
20. I. Méndez-Díaz, P. Zabala, and A. Cutting Plane Algorithm for graph coloring Discrete Applied Mathematics 156 2008 159 179
21. A. Mehrotra, and M.A. Trick. A column generation approach for graph coloring INFORMS Journal on Computing 8 4 1996 344 354
22. E. Malaguti, M. Monaci, and P. Toth An exact approach for the Vertex Coloring Problem Discrete Optimization 8 2 2011 174 190
23. Gualandi S, Malucelli F. Exact solution of graph coloring problems via constraint programming and column generation. Technical report. Optimization Online; 2010.
24. Held S, Sewell EC, Cook W. Safe lower bounds for graph coloring. Accepted for IPCO; 2011.
25. P. Hansen, M. Labbé, and D. Schindl. Set covering and packing formulations of graph coloring: algorithms and first polyhedral results Discrete Optimization 6 2009 135 147
26. E. Sewell An improved algorithm for exact graph coloring M.A. Trick, D.S. Johnson, Cliques, coloring, and satisfiability. Proceedings of the second DIMACS implementation challenge vol. 26 1996 American Mathematical Society 359 373
27. D.W. Matula., G. Marble., and J.D. Issacson. Graph coloring algorithms R.C. Read, Graph theory and computing 1972 Academic Press New York
28. D.J.A. Welsh, and M.B. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems The Computer Journal 10 1 1967 85 86
29. J.R. Brown Chromatic scheduling and the chromatic number problem Management Science 19 4 1972 456 463 Application Series, Part 1
30. Johnson DS, Trick MA., editors. Cliques, coloring, and satisfiability: 2nd DIMACS implementation challenge, 1993. DIMACS series in discrete mathematics and theoretical computer science. American Mathematical Society; 1996.
31. P. San Segundo, D. Rodriguez-Losada, and A. Jimenez An exact bit-parallel algorithm for the maximum clique problem Computers & Operations Research 38 2 2011 571 581