Sciweavers

Share
WG
2009
Springer

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs

10 years 4 months ago
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact algorithm that solves it in O∗ (αn ) time for some constant α < 2 is a notorious open problem. For a claw-free graph G, finding a hamiltonian cycle is equivalent to finding a closed trail (eulerian subgraph) that dominates the edges of some associated graph H. Using this translation we obtain two exact algorithms that solve the Hamiltonian Cycle problem for the class of claw-free graphs: one algorithm that uses O∗
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WG
Authors Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
Comments (0)
books