Broersma, H. J. and Fomin, F. V. and Hof van 't, P. and Paulusma, Daniel (2009) 'Fast exact algorithms for hamiltonicity in claw-free graphs.', in Graph-theoretic concepts in computer science : 35th International Workshop, WG 2009, 24-26 June 2009, Montpellier, France ; revised papers. Berlin: Springer, pp. 44-53. Lecture notes in computer science. (5911).
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 *(1.6818 n ) time and exponential space, and one algorithm that uses O *(1.8878 n ) time and polynomial space.
|Item Type:||Book chapter|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1007/978-3-642-11409-0_4|
|Date accepted:||No date available|
|Date deposited:||No date available|
|Date of first online publication:||2009|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|