Sciweavers

Share
WG
2009
Springer
10 years 5 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, ļ¬nding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...
books