An analysis of heuristics for vertex colouring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6049 LNCS, Issue , 2010, Pages 326-337

  Chiarandini, Marco ^a   Stützle, Thomas ^b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Experimental analysis; Graph coloring; Heuristics

Indexed keywords

ALGORITHM PERFORMANCE; ANALYSIS OF HEURISTICS; EXPERIMENTAL ANALYSIS; GRAPH COLORINGS; GRAPH COLOURING; HEURISTICS; RANDOM GRAPHS; STATISTICAL STUDY; STRUCTURAL FEATURE;

ALGORITHMS;

GRAPH THEORY;

EID: 78650641097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_28     Document Type: Conference Paper

References (20)

1. Bondy, J., Murty, U.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, Heidelberg (2008).
2. Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22(4), 251-256 (1979).
3. Chiarandini, M., Dumitrescu, I., Stützle, T.: Stochastic local search algorithms for the graph colouring problem. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, pp. 63-1-63-17. Chapman & Hall/CRC, Boca Raton (2007).
4. Chiarandini, M.: Bibliography on graph-vertex coloring (2010), http://www.imada.sdu.dk/~marco/gcp.
5. Chudnovsky, M., Cornuéjols, G., Liu, X., Seymour, P., Vušković, K.: Recognizing Berge graphs. Combinatorica 25(2), 143-186 (2005).
6. Conover, W.: Practical Nonparametric Statistics, 3rd edn. John Wiley & Sons, New York (1999).
7. Culberson, J., Beacham, A., Papp, D.: Hiding our colors. In: Proceedings of the CP 1995 Workshop on Studying and Solving Really Hard Problems, Cassis, France, September 1995, pp. 31-42 (1995).
8. Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379-397 (1999).
9. Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Computers & Operations Research 33, 2547-2562 (2006).
10. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169-197 (1981).
11. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research 39(3), 378-406 (1991).
12. Johnson, D.S., Mehrotra, A., Trick, M.A.: Special issue on computational methods for graph coloring and its generalizations. Discrete Applied Mathematics 156(2), 145-146 (2008).
13. Johnson, D.S., Trick, M. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993. DIMACS Series in DMTCS, vol. 26. American Mathematical Society, Providence (1996).
14. Leighton, F.T.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards 84(6), 489-506 (1979).
15. Malaguti, E., Toth, P.: A survey on vertex coloring problems. International Transactions in Operational Research, 1-34 (2009).
16. Mehrotra, A., Trick, M.: A column generation approach for graph coloring. INFORMS Journal on Computing 8(4), 344-354 (1996).
17. Peemöller, J.: A correction to Brelaz's modification of Brown's coloring algorithm. Communications of the ACM 26(8), 595-597 (1983).
18. Trick, M.: Network resources for coloring a graph (1994), http://mat.gsia.cmu.edu/COLOR/color.html (last visited: February 2005).
19. Trick, M.: ROIS: Registry for optimization instances and solutions (2009), http://mat.tepper.cmu.edu/ROIS/(last visited: December 2009).
20. de Werra, D.: Heuristics for graph coloring. Computing Supplement 7, 191-208 (1990).