Improved Edge-Coloring with Three Colors

@inproceedings{Kowalik2006ImprovedEW,
  title={Improved Edge-Coloring with Three Colors},
  author={Lukasz Kowalik},
  booktitle={WG},
  year={2006}
}
We show an O(1.344) = O(2) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, O(2) algorithm of Beigel and Eppstein [1]. We apply a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and conquer” technique. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

3-coloring in time O(1.3289n)

J. Algorithms • 2005
View 9 Excerpts
Highly Influenced

Quasiconvex Analysis of Backtracking Algorithms

SODA • 2004
View 6 Excerpts
Highly Influenced

The Traveling Salesman Problem for Cubic Graphs

J. Graph Algorithms Appl. • 2003
View 6 Excerpts
Highly Influenced

and D

F. Fomin, F. Grandoni
Kratsch. Measure and conquer: A simple O(20.288n) independent set algorithm. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’06), pages 18–25 • 2006
View 3 Excerpts

Similar Papers

Loading similar papers…