Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
Attributed to:
Exact algorithms for NP-hard problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-11409-0_4
Publication URI: http://dx.doi.org/10.1007/978-3-642-11409-0_4
Type: Book Chapter
Book Title: Graph-Theoretic Concepts in Computer Science (2010)
Page Reference: 44-53
ISBN: 978-3-642-11408-3
ISSN: 1436-3798