# Parameterized Complexity of Length-bounded Cuts and Multicuts

@article{Dvok2018ParameterizedCO,
title={Parameterized Complexity of Length-bounded Cuts and Multicuts},
author={P. Dvoř{\'a}k and D. Knop},
journal={Algorithmica},
year={2018},
volume={80},
pages={3597-3617}
}
• Published 2018
• Mathematics, Computer Science
• Algorithmica
• We study the Minimum Length-Bounded Cut problem where the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least $$L + 1$$L+1 long. We show the problem can be computed in $$\mathsf {FPT}$$FPT time with respect to L and the tree-width of the input graph G as parameters and with linear dependence of |V(G)| (i.e., in time $$f (L, {\text {tw}}(G))|V(G)|$$f(L,tw(G))|V(G)| for a computable function f). We derive an… CONTINUE READING
7 Citations

#### References

SHOWING 1-10 OF 34 REFERENCES
On Algorithms for $L$-bounded Cut Problem
• P. Kolman
• Mathematics, Computer Science
• ArXiv
• 2017
• 2
• PDF
Paths of bounded length and their cuts: Parameterized complexity and algorithms
• Computer Science, Mathematics
• Discret. Optim.
• 2011
• 43
• PDF
Tree-depth, subgraph coloring and homomorphism bounds
• Computer Science, Mathematics
• Eur. J. Comb.
• 2006
• 215
• PDF
Capacitated Domination and Covering: A Parameterized Perspective
• Mathematics, Computer Science
• IWPEC
• 2008
• 74
• PDF
On the directed hop-constrained shortest path problem
• Mathematics, Computer Science
• Oper. Res. Lett.
• 2004
• 56
Length-bounded cuts and flows
• 67
• PDF