Olivier Coudert
ABSTRACT
Graph coloring has several important applications inVLSI CAD. Since graph coloring is NP-complete, heuristics are used to approximate the optimum solution. But heuristic solutions are typically 10% off, and as much as100% off, the minimum coloring. This paper shows thatsince real-life graphs appear to be 1-perfect, one can indeed solve them exactly for a small overhead.
- 1.M. Bellare, O. Goldreich, M. Sudan, "Free bits, PCPs and non-approximability - towards tight results", Proc. of 36th Ann. IEEE Syrup. on Foundations of Comput. Sci., pp. 422-431, 1995. Google Scholar
Digital Library
- 2.B. Bollob~s, P. ErdSs, "Cliques in Random Graphs", Math. Proc. Camb. Phil. Soc., 80, pp. 419-427, 1976.Google ScholarCross Ref
- 3.B. Bollob~s, "The Chromatic Number of Random Graphs", Combinatorica, 8-1, pp. 49-55, 1988.Google ScholarCross Ref
- 4.D. Br~laz, "New Methods to Color Vertices of a Graph", Comm. of the ACM, 22-4, pp. 251-256, 1979. Google ScholarDigital Library
- 5.J. R. Brown, "Chromatic Scheduling and the Chromatic Number Problem", Management Sci., 19, pp. 456-463, 1972.Google ScholarDigital Library
- 6.J. Cong, M. Hossain, N. A. Sherwani, "A Provably Good Multilayer Topological Planar Routing Algorithm in IC Layout Designs", IEEE Trans. on CAD, 12-1, pp. 70-78, Jan. 1993.Google ScholarDigital Library
- 7.ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmark/, benchmark for graph coloring and clique, 1993.Google Scholar
- 8.D. Gajski, N. Dutt, A. Wu, S. Lin, High-Level Synthesis, Kluwer Ac. Pub., 1992.Google Scholar
- 9.M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979. Google ScholarDigital Library
- 10.M. GrSetschel, L. Lovgsz, A. Schrijver, ~The Ellipsoid Method and its Consequences in Combinatorial Optimization", Combinatorica, 1, pp. 169-197, 1981.Google ScholarCross Ref
- 11.M. M. Hallddrsson, ~A still better performance guarantee for approximate graph coloring", Inform. Process. Lett., 45, pp. 19-23, 1993. Google ScholarDigital Library
- 12.D. S. Johnson, ~Worst-Case Behavior of Graph-Coloring Algorithms", Proc. 5th Southeastern Conf. on Uombinatorics, Graph Theory, and Computing, pp. 513-528, Winnipeg, 1974.Google Scholar
- 13.L. Kueera, Combinatorial Algorithms, Adam Hilger, 1990.Google Scholar
- 14.F. T. Leighton, ~A Graph Coloring Algorithm for Large Scheduling Problems", Y. Res. Nat. Bur. Standards, 84, pp. 489-506, 1979.Google ScholarCross Ref
- 15.G. D. Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, 1994. Google ScholarDigital Library
- 16.C. A. Morgenstern, Algorithms for General Graph Coloring, Ph.D. thesis, Department of Computing Science, University of New Mexico, Albuquerque NM, 1990.Google Scholar
- 17.J. Mycielski, ~Sur le Coloriage des Graphes", Colloq. Math., 3, 1955Google Scholar
- 18.J. PeemSller, ~A Correction to Br~laz's Modification of Brown's Coloring Algorithm", Comm. of the ACM, 26, pp. 595-597, 1983. Google ScholarDigital Library
Index Terms
- Exact coloring of real-life graphs is easy
Recommendations
Colouring exact distance graphs of chordal graphs
AbstractFor a graph G = ( V , E ) and positive integer p, the exact distance- p graph G [ ♮ p ] is the graph with vertex set V and with an edge between vertices x and y if and only if x and y have distance p. ...
Exact square coloring of subcubic planar graphs
AbstractWe study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 receive distinct colors. The smallest number of colors ...
Exact square coloring of certain classes of graphs: Complexity and algorithms
AbstractA vertex coloring of a graph G = ( V , E ) is called an exact square coloring of G if any two vertices at distance exactly 2 receive different colors. The minimum number of colors required by an exact square coloring is called the ...
Comments