Paths of bounded length and their cuts: parameterized complexity and algorithms
From MaRDI portal
(Redirected from Publication:456699)
Recommendations
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Parameterized complexity of length-bounded cuts and multicuts
- Parametrized complexity of length-bounded cuts and multi-cuts
- Two edge-disjoint paths with length constraints
- Finding two edge-disjoint paths with length constraints
Cites work
- scientific article; zbMATH DE number 3121292 (Why is no real title available?)
- scientific article; zbMATH DE number 3845615 (Why is no real title available?)
- scientific article; zbMATH DE number 2086912 (Why is no real title available?)
- scientific article; zbMATH DE number 2119660 (Why is no real title available?)
- scientific article; zbMATH DE number 3353312 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A linear-time algorithm for edge-disjoint paths in planar graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- Algorithmic lower bounds for problems parameterized by clique-width
- Capacitated Domination and Covering: A Parameterized Perspective
- Color-coding
- Easy problems for tree-decomposable graphs
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Graph minors. XIII: The disjoint paths problem
- Heuristics for finding a maximum number of disjoint bounded paths
- Improved bounds for the unsplittable flow problem
- Length-Bounded Cuts and Flows
- Length-bounded cuts and flows
- Maximal Flow Through a Network
- Mengerian theorems for paths of bounded length
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On line disjoint paths of bounded length
- On miniaturized problems in parameterized complexity theory
- On problems without polynomial kernels
- On the Computational Complexity of Combinatorial Problems
- On the complexity of vertex-disjoint length-restricted path problems
- On the parameterized complexity of multiple-interval graph problems
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Planar capacitated dominating set is \(W[1]\)-hard
- The complexity of finding maximum disjoint paths with length constraints
- The complexity of finding two disjoint paths with min-max objective function
- The directed subgraph homeomorphism problem
Cited in
(27)- scientific article; zbMATH DE number 7765394 (Why is no real title available?)
- Snapshot disjointness in temporal graphs
- scientific article; zbMATH DE number 3876620 (Why is no real title available?)
- Confronting intractability via parameters
- Parameterized complexity of \((A,\ell)\)-path packing
- Long directed detours: reduction to 2-disjoint paths
- Two edge-disjoint paths with length constraints
- Length-bounded cuts: proper interval graphs and structural parameters
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- A constraint programming approach to the additional relay placement problem in wireless sensor networks
- On algorithms employing treewidth for \(L\)-bounded cut problems
- Parameterized complexity of length-bounded cuts and multicuts
- Fractals for kernelization lower bounds
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
- On the length of simplex paths: The assignment case
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- A survey of parameterized algorithms and the complexity of edge modification
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Parametrized complexity of length-bounded cuts and multi-cuts
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- The complexity of finding small separators in temporal graphs
- On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
- Finding two edge-disjoint paths with length constraints
- The complexity of finding small separators in temporal graphs
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- scientific article; zbMATH DE number 7758343 (Why is no real title available?)
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
This page was built for publication: Paths of bounded length and their cuts: parameterized complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456699)
