We show that the minimal length-bounded L-cut can be computed in linear time with respect to L and the tree-width of the input graph as parameters. We derive an FPT algorithm for a more general multi-commodity length bounded cut problem when parameterized by the number of terminals also. For the former problem we show a W[1]- hardness result when the parameterization is done by the path-width only (instead of the tree-width).
CITATION STYLE
Dvořák, P., & Knop, D. (2015). Parametrized complexity of length-bounded cuts and multi-cuts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9076, pp. 441–452). Springer Verlag. https://doi.org/10.1007/978-3-319-17142-5_37
Mendeley helps you to discover research relevant for your work.