Abstract
We show an O(1.344n) = O(20.427n) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, O(2n/2) algorithm of Beigel and Eppstein [1], We extend 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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kowalik, Ł. (2006). Improved edge-coloring with three colors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4271 LNCS, pp. 90–101). Springer Verlag. https://doi.org/10.1007/11917496_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
