Parametrized complexity of length-bounded cuts and multi-cuts
DOI10.1007/978-3-319-17142-5_37zbMATH Open1454.68056DBLPconf/tamc/DvorakK15OpenAlexW2262201633WikidataQ57937811 ScholiaQ57937811MaRDI QIDQ2948489FDOQ2948489
Authors: Pavel Dvořák, Dušan Knop 
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_37
Recommendations
- Parameterized complexity of length-bounded cuts and multicuts
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Length-bounded cuts: proper interval graphs and structural parameters
- The minimum \(k\)-way cut of bounded size is fixed-parameter tractable
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Cited In (15)
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Length-Bounded Cuts and Flows
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- On algorithms employing treewidth for \(L\)-bounded cut problems
- Parameterized complexity of length-bounded cuts and multicuts
- Length-bounded cuts and flows
- Simple and improved parameterized algorithms for multiterminal cuts
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
- Title not available (Why is that?)
- Fractals for kernelization lower bounds
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem
This page was built for publication: Parametrized complexity of length-bounded cuts and multi-cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948489)
