Exact algorithms for finding longest cycles in claw-free graphs

DOI10.1007/s00453-011-9576-4zbMath1259.05162WikidataQ60488416 ScholiaQ60488416MaRDI QIDQ1939671

Daniël Paulusma, Fedor V. Fomin, Hajo J. Broersma, Pim van 't Hof

Publication date: 5 March 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/9020/1/9020.pdf

zbMATH Keywords

Hamiltonian cycle problem; longest cycle problem

Mathematics Subject Classification ID

05C38: Paths and cycles

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C45: Eulerian and Hamiltonian graphs