Skip to main content
SpringerLink
Log in

An Experimental Analysis of Vertex Coloring Algorithms on Sparse Random Graphs

  • Conference paper
Applied Algorithms (ICAA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8321))

Included in the following conference series:

Abstract

The DSATUR algorithm for vertex coloring is popular both in its heuristic and exact (branch-and-bound) forms. Common to the known public implementations of the exact algorithm is the use of adjacency matrices to store the adjacency relations; this influences the algorithm’s implementation and its running time. In this paper we investigate the benefits of the introduction of supporting data structures to improve its running time: in addition to replacing the adjacency matrix by adjacency lists, thus shifting the focus from vertices to edges, we also introduce a priority queue data structure to assist in vertex selection. Our goal is to explore under which circumstances additional supporting data structures can speed up (exact) DSATUR.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. 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 

  2. Randall Brown, J.: Chromatic scheduling and the chromatic number problem. Management Science 19(4), 456–463 (1972)

    Article  MATH  Google Scholar 

  3. Burke, E.K., Mareček, J., Parkes, A.J., Rudová, H.: On a clique-based integer programming formulation of vertex colouring with applications in course timetabling. Technical Report NOTTCS-TR-2007-10, The University of Nottingham, Nottingham (2007)

    Google Scholar 

  4. Cai, L.: Parameterized complexity of vertex colouring. Discrete Applied Mathematics 127(3), 415–429 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education (2001)

    Google Scholar 

  6. Culberson, J.: Graph coloring programs (2001), http://webdocs.cs.ualberta.ca/~joe/Coloring/Colorsrc/index.html

  7. Erdös, P., Rényi, A.: On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 17–61 (1960)

    Google Scholar 

  8. Gamache, M., Hertz, A., Ouellet, J.O.: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Computers & Operations Research 34(8), 2384–2395 (2007)

    Article  MATH  Google Scholar 

  9. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC 1974, pp. 47–63. ACM, New York (1974)

    Chapter  Google Scholar 

  10. Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. INFORMS Journal on Computing 24(1), 81–100 (2012)

    Article  MathSciNet  Google Scholar 

  11. Hossain, S., Steihaug, T.: Graph coloring in the estimation of sparse derivative matrices: Instances and applications. Discrete Applied Mathematics 156(2), 280–288 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Johnson, D.J., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993. American Mathematical Society, Boston (1996)

    Google Scholar 

  13. Richard, M.: Karp. Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)

    Google Scholar 

  14. Klotz, W.: Graph coloring algorithms. Technical Report Mathematik-Bericht 5, Clausthal University of Technology, Clausthal, Germany (2002)

    Google Scholar 

  15. Lewis, R., Thompson, J.: On the application of graph colouring techniques in round-robin sports scheduling. Computers & Operations Research 38(1), 190–204 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  16. Malaguti, E., Monaci, M., Toth, P.: An exact approach for the vertex coloring problem. Discrete Optimization 8(2), 174–190 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  17. Matula, D.W.: On the complete subgraphs of a random graph. In: Proceedings of the 2nd Chapel Hill Conference on Combinatorial Mathematics and its Applications, Chapel Hill, NC, pp. 356–369 (1970)

    Google Scholar 

  18. Méndez-Díaz, I., Zabala, P.: A cutting plane algorithm for graph coloring. Discrete Applied Mathematics 156(2), 159–179 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  19. Östergård, P.R.J.: A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing 8, 424–436 (2001)

    MATH  MathSciNet  Google Scholar 

  20. Segundo, P.S.: A new DSATUR-based algorithm for exact vertex coloring. Computers & Operations Research 39(7), 1724–1733 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  21. Sewell, E.C.: An improved algorithm for exact graph coloring. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 359–373 (1996)

    Google Scholar 

  22. Trick, M.: Network resources for coloring a graph (1994), http://mat.gsia.cmu.edu/COLOR/color.html

  23. Trick, M.: ROIS: Registry for optimization instances and solutions (2009), http://mat.tepper.cmu.edu/ROIS/solutions/coloring/display_sol.php

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Systems, University of Limerick, Ireland

    Patrick Healy & Andrew Ju

Authors
  1. Patrick Healy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Ju
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Engineering, Heritage Institute of Technology, Chowbaga Road, Anandapur, 700107, Kolkata, India

    Prosenjit Gupta

  2. Department of Computer Engineering and Informatics, University of Patras, 26500, Patras, Greece

    Christos Zaroliagis

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Healy, P., Ju, A. (2014). An Experimental Analysis of Vertex Coloring Algorithms on Sparse Random Graphs. In: Gupta, P., Zaroliagis, C. (eds) Applied Algorithms. ICAA 2014. Lecture Notes in Computer Science, vol 8321. Springer, Cham. https://doi.org/10.1007/978-3-319-04126-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04126-1_15

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04125-4

  • Online ISBN: 978-3-319-04126-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation