The Parameterized Complexity of Graph Cyclability
From MaRDI portal
Publication:5891809
DOI10.1007/978-3-662-44777-2_41zbMath1425.05033arXiv1412.3955MaRDI QIDQ5891809
Marcin Kaminski, Petr A. Golovach, Dimitrios M. Thilikos, Spyridon Maniatis
Publication date: 8 October 2014
Published in: SIAM Journal on Discrete Mathematics, Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3955
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
