Paths of bounded length and their cuts: parameterized complexity and algorithms
From MaRDI portal
Publication:456699
DOI10.1016/j.disopt.2010.09.009zbMath1248.90071MaRDI QIDQ456699
Petr A. Golovach, Dimitrios M. Thilikos
Publication date: 16 October 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.09.009
parameterized algorithms; parameterized complexity; bounded length cuts; bounded length disjoint paths
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems