The parameterized complexity of graph cyclability

DOI10.1007/978-3-662-44777-2_41MaRDI QIDQ6829888zbMATH OpenFDO

Authors Petr A. Golovach, Marcin Kamiński, Spyridon Maniatis, Dimitrios M. Thilikos

Publication date 8 October 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44777-2_41

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: The parameterized complexity of graph cyclability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829888)