Exact Coloring of Real-Life Graphs is Easy

  title={Exact Coloring of Real-Life Graphs is Easy},
  author={Olivier Coudert},
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. 
Highly Cited
This paper has 65 citations. REVIEW CITATIONS
41 Citations
0 References
Similar Papers


Publications citing this paper.

66 Citations

Citations per Year
Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…