The power of cut-based parameters for computing edge-disjoint paths
From MaRDI portal
Publication:2659778
DOI10.1007/S00453-020-00772-WOpenAlexW2975202594MaRDI QIDQ2659778FDOQ2659778
Sebastian Ordyniak, Robert Ganian
Publication date: 26 March 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00772-w
Cites Work
- Title not available (Why is that?)
- Fundamentals of parameterized complexity
- Graph minors. XIII: The disjoint paths problem
- Linear time solvable optimization problems on graphs of bounded clique-width
- Parametrized complexity theory.
- Parameterized Algorithms
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- On the Computational Complexity of Combinatorial Problems
- Title not available (Why is that?)
- The structure of graphs not admitting a fixed immersion
- Immersions in Highly Edge Connected Graphs
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Finding edge-disjoint paths in partial \(k\)-trees
- Title not available (Why is that?)
- Approximating disjoint-path problems using packing integer programs
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- An FPT 2-approximation for tree-cut decomposition
- Algorithmic Applications of Tree-Cut Width
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
- On Routing Disjoint Paths in Bounded Treewidth Graphs
- Title not available (Why is that?)
Cited In (10)
- Slim tree-cut width
- On structural parameterizations of the edge disjoint paths problem
- Edge-treewidth: algorithmic and combinatorial properties
- Fixed-parameter algorithms for computing RAC drawings of graphs
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- Algorithmic Applications of Tree-Cut Width
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
- The complexity of optimizing atomic congestion
- An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
- Title not available (Why is that?)
This page was built for publication: The power of cut-based parameters for computing edge-disjoint paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659778)
