New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
From MaRDI portal
Publication:4606313
DOI10.4230/LIPIcs.ESA.2016.42zbMath1397.68223OpenAlexW2964080336MaRDI QIDQ4606313
Krzysztof Fleszar, Joachim Spoerhase, Matthias Mnich
Publication date: 2 March 2018
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2016.42
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (7)
The power of cut-based parameters for computing edge-disjoint paths ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Unnamed Item ⋮ Unnamed Item ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ On structural parameterizations of the edge disjoint paths problem ⋮ Unnamed Item
This page was built for publication: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
