Skip to main content
SpringerLink
Log in

A color-exchange algorithm for exact graph coloring

  • Track1: Graph Algorithms
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

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

Included in the following conference series:

  • 130 Accesses

Abstract

DEXCH, a color-exchange exact graph coloring algorithm is presented. On many classes of graphs, DEXCH can, in the mean, find the chromatic number of a graph considerably faster than the DSATUR algorithm. The improvement over DSATUR stems from the ability to reorganize the subset of colored vertices and to detect in certain instances the existence of a complete subgraph of cardinality equal to the number of colors used in the best coloring found so far. The mean improvement over DSATUR is greatest on high edge-density graphs attaining the value of 42% on random graphs of edge-density 0.7 on 64 vertices.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brelaz, D.: New methods to color vertices of a graph. Comm. ACM, 22, 4, Apr. 1979, pp251–256.

    Article  MATH  MathSciNet  Google Scholar 

  2. Garey, M.R. and D.S. Johnson: The complexity of near-optimal graph coloring. J. ACM, 23, 1, Jan. 1976, pp43–49.

    Article  MATH  MathSciNet  Google Scholar 

  3. Johnson, D.S., C.R. Aragon, L.A. McGeoch and C. Schevon: Optimization by simulated annealing: an experimental evaluation, Part II (graph coloring and number partitioning). Manuscript, 1989.

    Google Scholar 

  4. Johri, A. and D.W. Matula: Probabilistic bounds and heuristic algorithms for coloring large random graphs. Tech. Rep. 82-CSE-6, Southern Methodist University, Dallas, Tex., June 1982.

    Google Scholar 

  5. Korman, S.M.: The graph coloring problem. In Combinatorial Optimization, Eds. N. Christofides et al., Wiley, New York, 1979, pp211–235.

    Google Scholar 

  6. Kubale, M. and B. Jackowski: A general implicit enumeration algorithm for graph coloring. Comm. ACM, 28, 4, April 1985, pp412–418.

    Article  Google Scholar 

  7. Leighton, F.T.: A graph coloring algorithm for large scheduling problems. J. Res. Nat. Bur. Standards, 84, 6, Nov. 1979, pp489–506.

    MATH  MathSciNet  Google Scholar 

  8. Park, S.K. and K.W. Miller: Random number generators: good ones are hard to find. Comm. ACM, 31, 10, Oct. 1988, pp1192–1201.

    Article  MathSciNet  Google Scholar 

  9. Sager, T.J. and S.J. Lin: An improved exact graph coloring algorithm. Tech. Rep. CSc-89-1, University of Missouri-Rolla, Rolla, Missouri, April 1989.

    Google Scholar 

  10. Sager, T.J. and S.J. Lin: A pruning procedure for exact graph coloring. Tech. Rep. CSc-89-3, University of Missouri-Rolla, Rolla, Missouri, October 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Missouri-Rolla, 65401, Rolla, Missouri, USA

    Thomas J. Sager

  2. Department of Computer Science, Chung-Yung University, Chung-Li, Taiwan

    Shi-Jen Lin

Authors
  1. Thomas J. Sager
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shi-Jen Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sager, T.J., Lin, SJ. (1991). A color-exchange algorithm for exact graph coloring. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038468

Download citation

  • DOI: https://doi.org/10.1007/BFb0038468

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation