Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


Durham Research Online
You are in:

Fast exact algorithms for hamiltonicity in claw-free graphs.

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).

Abstract

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
Record Created:15 Dec 2009 10:35
Last Modified:03 Apr 2013 13:13

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library