Heuristics for rapidly four-coloring large planar graphs
- 112 Downloads
We present several algorithms for rapidly four-coloring large planar graphs and discuss the results of extensive experimentation with over 140 graphs from two distinct classes of randomly generated instances having up to 128,000 vertices. Although the algorithms can potentially require exponential time, the observed running times of our more sophisticated algorithms are linear in the number of vertices over the range of sizes tested. The use of Kempe chaining and backtracking together with a fast heuristic which usually, but not always, resolves impasses gives us hybrid algorithms that: (1) successfully four-color all our test graphs, and (2) in practice run, on average, only twice as slow as the well-known, nonexact, simple to code, Θ(n) saturation algorithm of Brélaz.
Key wordsFour coloring Planar graphs Kempe chaining Saturation algorithm of Brélaz Heuristic algorithms
Unable to display preview. Download preview PDF.
- R. Archuleta and H. Shapiro. 1986. A Fast Probabilistic Algorithm for Four-Coloring Large Planar Graphs.Proc. Fall 1986 Joint Computer Conference, pp. 595–600.Google Scholar
- P. J. Heawood. 1890. Map-Colour Theorems.Quart. J. Math.,24, 332–338.Google Scholar
- G. Marble and D. W. Matula. 1972. Computational Aspects of 4-Coloring Planar Graphs. Technical Report, University of Wisconsin.Google Scholar
- D. W. Matula, G. Marble, and J. D. Isaacson. 1972. Graph Coloring Algorithms. InGraph Theory and Computing (R. C. Read, ed.), Academic Press, New York, pp. 109–122.Google Scholar
- D. W. Matula, Y. Shiloach, and R. E. Tarjan. 1981. Analysis of Two Linear-Time Algorithms for Five-Coloring a Planar Graph.Congr. Numer.,33, 401.Google Scholar
- C. Morgenstern. 1988. Saturation Based Graph Coloring Algorithms. Technical Report CS88-1, University of New Mexico, Albuquerque, New Mexico.Google Scholar
- C. Morgenstern. 1990. Algorithms for General Graph Coloring. Doctoral Dissertation, Department of Computer Science, University of New Mexico, Albuquerque, New Mexico.Google Scholar
- C. Morgenstern and H. D. Shapiro. 1984. Performance of Approximation Coloring Algorithms on Maximally Planar Graphs. Technical Report CS84-7, University of New Mexico, Albuquerque, New Mexico.Google Scholar
- T. Nishizeki and N. Chiba. 1988. Planar Graphs: Theory and Algorithms.Ann. Discrete Math.,32.Google Scholar
- T. L. Saaty and P. C. Kainen. 1986.The Four-Color Problem. Dover, New York.Google Scholar