Skip to main content
SpringerLink
Log in

A Fast and Simple Local Search for Graph Coloring

  • Conference paper
  • First Online:
Algorithm Engineering (WAE 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1668))

Included in the following conference series:

Abstract

In this paper a fast and simple local search algorithm for graph coloring is presented. The algorithm is easy to implement and requires the storage of only one solution. Experimental results on benchmark instances of the DIMACS Challenge and on random graphs are given.

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. Bianco, L., Caramia, M., and Dell’Olmo, P.: Solving a Preemptive Scheduling Problem using Coloring Technique, in Project Scheduling. Recent Models, Algorithms and Applications, J. Weglarz (Ed.) Kluwer Academic Publishers (1998).

    Google Scholar 

  2. Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., and Weglarz, J.: Scheduling in Computer and Manufacturing Processes, Springer (1996).

    Google Scholar 

  3. Brelaz, D., “New methods to color the vertices of a graph”: Communications of the ACM22 (1979), 251–256.

    Article  MathSciNet  Google Scholar 

  4. Cangalovic, M., and Schreuder, J.: “Exact coloring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths”, EJOR51 (1991) 248–258.

    Article  Google Scholar 

  5. Chams, M., Hertz, A., and de Werra, D.: “Some experiments with simulated annealing for coloring graphs”, EJOR32 (1987), 260–266.

    Article  MathSciNet  Google Scholar 

  6. Coffman, E. G.: “An Introduction to Combinatorial Models of Dynamic Storage Allocation”, SIAM Review25 (1983), 311–325.

    Article  MathSciNet  Google Scholar 

  7. Culberson’s Coloring WEB site: http://web.cs.ualberta.ca/joe/Coloring/index.html.

  8. Dailey, D. P.: “Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete”, Discrete Mathematics30 (1980), 289–293.

    Article  MathSciNet  Google Scholar 

  9. DIMACS ftp site for benchmark graphs: ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/color/.

  10. DIMACS ftp site for benchmark machines: http://www.dimacs.rutgers.edu/pub/challenge/graph/benchmarks/volume/mac hine.

  11. Eiben, A. E., Van Der Hauw, J. K., and Van Hemert, J. I.: “Graph Coloring with Adaptive Evolutionary Algorithms” Journal of Heuristics4 (1998), 25–46.

    Article  Google Scholar 

  12. Fleurent, C., and Ferland, J. A.: “Genetic and hybrid algorithms for graph coloring”, Annals of Operations Research, 63 (1995), 437–461.

    Article  Google Scholar 

  13. Fleurent, C., and Ferland, J. A.: “Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability”, Volume 26 of Discrete Mathematics and Theoretical Computer Science AMS (1996), 619–652.

    MATH  Google Scholar 

  14. Gardner, M.: The Unexpected Hanging and Other Mathematical Diversions, Simon and Schuster, New York, (1969).

    Google Scholar 

  15. Garey, M. R., and Johnson, D. S.: “The complexity of near-optimal graph coloring”, Journal of the ACM23 (1976), 43–49.

    Article  MathSciNet  Google Scholar 

  16. Garey, M. R., Johnson, D. S., and Stockmeyer, L.: “Some simplified NP-complete graph problems”, Theor. Comput. Sci.1 (1976), 237–267.

    Article  MathSciNet  Google Scholar 

  17. Hertz, A., and de Werra, D.: “Using Tabu Search Techniques for Graph Coloring”, Computing39 (1987), 345–351.

    Article  MathSciNet  Google Scholar 

  18. Johnson, D. S., Aragaon, C. R., McGeoch, L. A., and Schevon, C.: “Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning,” Operations Research39 (1991), 378–406.

    Article  Google Scholar 

  19. Knuth, D. E.: The Standford GraphBase, ACM Press, Addison Welsey, New York, (1993).

    Google Scholar 

  20. Krawczyk, H., and Kubale, M.: “An approximation algorithm for diagnostic test scheduling in multicomputer systems”, IEEE Trans. Comput.C-34 (1985), 869–872.

    Article  Google Scholar 

  21. Kubale, M., and Jackowski, B.: “A generalized implicit enumeration algorithm for graph coloring”, Communications of the ACM28 (1985), 412–418.

    Article  Google Scholar 

  22. Leighton, F. T.: “A graph coloring algorithm for large scheduling problems”, Journal of Research of the National Bureau of Standards84 (1979), 412–418.

    Article  MathSciNet  Google Scholar 

  23. Lund, C., and Yannakakis, M.: “On the Hardness of Approximating Minimization Problems”, Proc. 25th Annual ACM Symp. on Theory of Computing, (1993), 286–293 (Full version in J. ACM41 5 (1994), 960-981.)

    MathSciNet  MATH  Google Scholar 

  24. Mehrotra, A., and Trick, M. A.: “A Column Generation Approach for Graph Coloring”, INFORMS J. on Computing8 (1996), 344–354.

    Article  Google Scholar 

  25. Morgenstern, C.: “Distributed Coloration Neighborhood Search”, Volume 26 of Discrete Mathematics and Theoretical Computer Science AMS (1996), 335–358.

    MATH  Google Scholar 

  26. Mycielski, J.: “Sur le Coloriage des Graphes”, Colloquim Mathematiques3 (1955) 161–162.

    Article  Google Scholar 

  27. Osman, I. H., and Kelley, J. P.: Metaheuristics: Theory and Applications, Kluwer Academic Publishers, Hingam, MA (1996).

    Google Scholar 

  28. Sager, T. J., and Lin S.: “A Pruning Procedure for Exact Graph Coloring”, ORSA J. on Computing3 (1993), 226–230.

    Article  Google Scholar 

  29. Sewell, E. C.: “An Improved Algorithm for Exact Graph Coloring”, Second DIMACS Challenge (COLORING Papers), DIMACS Series in Computer Mathematics and Theoretical Computer Science (1993), 359–373.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemi e Produzione, University of Rome “Tor Vergata, Via di Tor Vergata, 110-00133, Rome, Italy

    Massimiliano Caramia

  2. Dipartimento di Statistica, Probabilitá e Statistiche Applicate, University of Rome “La Sapienza, Piazzale Aldo Moro, 5-00133, Rome, Italy

    Paolo Dell’Olmo

Authors
  1. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo Dell’Olmo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Duke University, Box 90129, Durham, NC, 27708-0129, USA

    Jeffrey S. Vitter

  2. Department of Computer Science, University of London, King’s College, Strand, London, WC2R 2LS, UK

    Christos D. Zaroliagis

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caramia, M., Dell’Olmo, P. (1999). A Fast and Simple Local Search for Graph Coloring. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-48318-7_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66427-7

  • Online ISBN: 978-3-540-48318-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation