Skip to main content
SpringerLink
Log in

A Range-Compaction Heuristic for Graph Coloring

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a “pressure” component and an annealing schedule for it. The value of this component is empirically quantified. This algorithm is evaluated on a wide range of DIMACS benchmark graphs, and found to be competitive with state-of-the-art algorithms in terms of solution quality and run time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barbosa, V.C., C.A.G. Assis, and J.O. do Nascimento. (—). "Two Novel Evolutionary Formulations of the Graph Coloring Problem." J. of Combinatorial Optimization(to appear), available at cite-seer.nj.nec.com/479842.html.

  • Berger, M.O. (1994). "k-Coloring Vertices Using a Neural Network with Convergence to Valid Solutions." <In> IEEE Int. Conf. on Neural Networks, IEEE Press, vol. 7, pp. 4514–4517.

    Google Scholar 

  • Bollobas, B. and A. Thomason. (1985). "Random graphs of small order." <In> M. Karonski and A. Rucinski <nt>(eds.)</nt>, Random Graphs '83,volume 28 of Annals of Discrete Mathematics, pp. 47–97. North-Holland Publishing Co., Amsterdam.

    Google Scholar 

  • Brelaz, D. (1979). "New Methods to Color the Vertices of a Graph." Communications of the ACM 22(4), 251–256.

    Google Scholar 

  • Costa, D. and A. Hertz. (1997). "Ants Can Color Graphs." J. of the Operational Research Society48, 295–305.

    Google Scholar 

  • Costa, D., A. Hertz, and O. Dubuis. (1995). "Embedding of a Sequential Algorithm Within an Evolutionary Algorithm for Coloring Problems in Graphs." Journal of Heuristics1, 105–128.

    Google Scholar 

  • Chams, M., A. Hertz, and D. de Werra. (1987). "Some Experiments with Simulated Annealing for Coloring Graphs." European Journal of Operational Research32, 260–266.

    Google Scholar 

  • Culberson, J.C. and F. Luo. (1996). "Exploring the k-Colorable Landscape with Iterated Greedy." <In> DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, pp. 245–284.

    Google Scholar 

  • Coudert, O. (1997). "Exact Coloring of Real-Life Graphs is Easy." <In> Proc. of the 34th Design Automation Conf., ACM Press, pp. 121–126.

  • Culberson, J. Joseph Culberson's Coloring Page. uhttp://web.cs.ualberta.ca/∼joe/Coloring.

  • Dahl, E.D. (1987). "Neural Network Algorithm for an NP-Complete Problem: Map and Graph Coloring." <In> IEEE Int. Conf. on Neural Networks, IEEE Press, vol. 3, pp. 113–120.

    Google Scholar 

  • de Werra, D. (1985). "An Introduction to Timetabling." European Journal of Operational Research19, 151–162.

    Google Scholar 

  • De Micheli, G. (1994). Synthesis and Optimization of Digital Circuits. McGraw Hill.

  • Dorne, R. and J. Hao. (1998). "Tabu Search for Graph Coloring, t-Coloring and Set t-Colorings."

  • DIMACS benchmark program, dfmax.c, and documentation, README, can be found in the ftp site. ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/.

  • Di Blas, A., A. Jagota, and R. Hughey. (2002). "Energy Function-Based Approaches to Graph Coloring." IEEE Trans. on Neural Networks13(1), 81–91.

    Google Scholar 

  • Donnelly, P.J. and D.J.A. Welsh. (1984). "The Antivoter Problem: Random 2-Colourings of Graphs." <In> B. Bollobas <nt>(ed.)</nt>, Graph Theory and Combinatorics, Academic Press, pp. 133–144.

  • Fleurent, C. and J.A. Ferland. (1996). "Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability." <In> DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, pp. 619–652.

    Google Scholar 

  • Gajski, D., N. Dutt, A. Wu, and S. Lin. (1992). High-Level Synthesis: Introduction to Chip and System Design. Kluwer Academic Publishers.

  • Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman.

  • Gassen, D.W. and J.D. Carothers. (1993). "Graph Color Minimization Using Neural Networks." <In> IEEE Int. Joint Conf. on Neural Networks, IEEE Press, pp. 1541–1544.

  • Glover, F., M. Parker, and J. Ryan. (1996). "Coloring by Tabu Branch and Bound." <In> DIMACS Series in Dis-crete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, pp. 285–308.

    Google Scholar 

  • Hertz, A. and D. de Werra. (1987). "Using Tabu Search Techniques for Graph Coloring." Computing39, 345–351.

    Google Scholar 

  • Home page of Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). http://dimacs.rutgers.edu.

  • Jagota, A. (1996). "An Adaptive, Multiple Restarts Neural Network Algorithm for Graph Coloring." European J. of Operational Research93, 257–270.

    Google Scholar 

  • Johnson, D.S., C.R. Aragon, L.A. Mcgeoch, and C. Schevon. (1991). "Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning." Operations Research39(3), 378–406.

    Google Scholar 

  • Johnson, D.S. and M.A. Trick. <nt>(eds.)</nt> (1996). Clique, Coloring, and Satisfiability-Second DIMACS Implementa-tion Challenge. American Mathematical Society.

  • Joslin, D.E. and D.P. Clements. (1999). "'Squeaky Wheel' Optimization." J. of Artificial Intelligence Research10, 353–373.

    Google Scholar 

  • Karger, D., R. Motwani, and M. Sudan. (1994). "Approximate Graph Coloring by Semidefinite Programming." <In> Proc. of 35th IEEE Symp. on the Foundations of Computer Science, IEEE Comp. Soc. Press, pp. 2–43.

  • Kirovski, D. and M. Potkonjak. (1998). "Efficient Coloring of a Large Spectrum of Graphs." <In> Proc. of the 35th Design Automation Conf., ACM Press, pp. 427–432.

  • Knuth, D.E. (1994). "The Sandwich Theorem." Electronic J. of Combinatorics, 1, Article 1, approx. 48 pp. (elec-tronic).

  • Leighton, F.T. (1979). "A Graph Coloring Algorithm for Large Scheduling Problems." J. of Research of the National Bureau of Standards84(6), 489–503.

    Google Scholar 

  • Lewandowski, G. and A. Condon. (1996). "Experiments with Parallel Graph Coloring Heuristics and Applications of Graph Coloring." <In> DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, pp. 309–334.

    Google Scholar 

  • Mehrotra, A. and M.A. Trick. (1996). "A Column Generation Approach for Graph Coloring." INFORMS Journal on Computing8, 344–354.

    Google Scholar 

  • Morgenstern, C. (1996). "Distributed Coloration Neighborhood Search." <In> DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, pp. 335–358.

    Google Scholar 

  • Peterson, C. and B. Soderberg. (1989). "A New Method for Mapping Optimization Problems onto Neural Net-works." International Journal of Neural Systems1(1), 3–22.

    Google Scholar 

  • Petford, A.D. and D.J.A. Welsh. (1989). "A Randomised 3-Colouring Algorithm." Discrete Mathematics74, 253–261.

    Google Scholar 

  • Philipsen, W.J.M. and L. Stok. (1991). "Graph Coloring Using Neural Networks." <In> IEEE Int. Symp. on Circuits Systems,vol. 3, pp. 1597–1600.

    Google Scholar 

  • Ramanathan, S. and E.L. Lloyd. (1993). "Scheduling Broadcasts in Multi-Hop Radio Networks." IEEE/ACM Transactions on Networking1(2), 166–172.

    Google Scholar 

  • Smith, K. and M. Palaniswami. (1997). "Static and Dynamic Channel Assignment Using Neural Networks." IEEE Journal on Selected Areas in Communications15(2), 238–249.

    Google Scholar 

  • Takefuji, Y. and K.C. Lee. (1991). "Artificial Neural Networks for Four-Coloring Map Problems and k-Colorability Problems." IEEE Trans. on Circuits and Systems-I, 38(3), 326–333.

    Google Scholar 

  • Vesel, A. and J. Zerovnik. (2000). "How Good Can Ants Color Graphs?" J. of Computing and Information Technology-CIT8, 131–136.

    Google Scholar 

  • Welsh, D.J.A. and M.B. Powell. (1967). "An Upper Bound for the Chromatic Number of a Graph and its Application to Timetabling Problems." The Computer Journal10, 85–86.

    Google Scholar 

  • Wu, C.W. (1998). "Graph Coloring Via Sinchronization of Coupled Oscillators." IEEE Trans. on Circuits and Systems-I45(9), 974–978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, University of California, Santa Cruz, 1156 High St. Santa Cruz, CA, 95064, USA

    Andrea Di Blas, Arun Jagota & Richard Hughey

Authors
  1. Andrea Di Blas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arun Jagota
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard Hughey
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Di Blas, A., Jagota, A. & Hughey, R. A Range-Compaction Heuristic for Graph Coloring. Journal of Heuristics 9, 489–506 (2003). https://doi.org/10.1023/B:HEUR.0000012448.70007.32

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:HEUR.0000012448.70007.32

Search

Navigation