Skip to main content
SpringerLink
Log in

An Analysis of Heuristics for Vertex Colouring

  • Conference paper
Experimental Algorithms (SEA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6049))

Included in the following conference series:

Abstract

Several heuristics have been presented in the literature for finding a proper colouring of the vertices of a graph using the least number of colours. These heuristics are commonly compared on a set of graphs that served two DIMACS competitions. This set does not permit the statistical study of relations between algorithm performance and structural features of graphs. We generate a new set of random graphs controlling their structural features and advance the knowledge of heuristics for graph colouring. We maintain and make all algorithms described here publically available in order to facilitate future comparisons.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bondy, J., Murty, U.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  2. Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22(4), 251–256 (1979)

    Article  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  6. Conover, W.: Practical Nonparametric Statistics, 3rd edn. John Wiley & Sons, New York (1999)

    Google Scholar 

  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)

    Google Scholar 

  8. Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Computers & Operations Research 33, 2547–2562 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  15. Malaguti, E., Toth, P.: A survey on vertex coloring problems. International Transactions in Operational Research, 1–34 (2009)

    Google Scholar 

  16. Mehrotra, A., Trick, M.: A column generation approach for graph coloring. INFORMS Journal on Computing 8(4), 344–354 (1996)

    Article  MATH  Google Scholar 

  17. Peemöller, J.: A correction to Brelaz’s modification of Brown’s coloring algorithm. Communications of the ACM 26(8), 595–597 (1983)

    Article  Google Scholar 

  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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Southern Denmark, Campusvej 55, Odense, Denmark

    Marco Chiarandini

  2. IRIDIA, Université Libre de Bruxelles, Av. Roosevelt 50, Brussels, Belgium

    Thomas Stützle

Authors
  1. Marco Chiarandini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Stützle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Napoli, Italy

    Paola Festa

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chiarandini, M., Stützle, T. (2010). An Analysis of Heuristics for Vertex Colouring. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13193-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13192-9

  • Online ISBN: 978-3-642-13193-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation