Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

DOI10.1007/978-3-642-11269-0_17zbMath1273.68172MaRDI QIDQ3656863

Petr A. Golovach, Dimitrios M. Thilikos

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_17

zbMATH Keywords

parameterized algorithms; parameterized complexity; bounded length cuts; bounded length disjoint paths

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)