English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Improved Edge Coloring with Three Colors

Kowalik, L. (2006). Improved Edge Coloring with Three Colors. In Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006 (pp. 90-101). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kowalik, Lukasz1, Author           
Fomin, Fedor V., Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We show an $O(1.344^n) = O(2^{0.427n})$ algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, $O(2^{n/2})$ algorithm of Beigel and Eppstein. 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.

Details

show
hide
Language(s): eng - English
 Dates: 2007-04-262006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314526
Other: Local-ID: C1256428004B93B8-B99A5ACCABF44B8AC1257237007FD6ED-Kowalik2005
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Bergen, Norway
Start-/End Date: 2006-06-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 90 - 101 Identifier: ISBN: 3-540-48381-0

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 4271 Sequence Number: - Start / End Page: - Identifier: -