On Routing Disjoint Paths in Bounded Treewidth Graphs

DOI10.4230/LIPIcs.SWAT.2016.15zbMath1378.68129arXiv1512.01829OpenAlexW2963586530MaRDI QIDQ5369517

Marcin Pilipczuk, Matthias Mnich, Andrej Risteski, Alina Ene

Publication date: 17 October 2017

Full work available at URL: https://arxiv.org/abs/1512.01829

zbMATH Keywords

algorithmstreewidthdata structuresdisjoint paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (7)

The power of cut-based parameters for computing edge-disjoint paths ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Unnamed Item ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ On structural parameterizations of the edge disjoint paths problem ⋮ Walking through waypoints ⋮ Unnamed Item

This page was built for publication: On Routing Disjoint Paths in Bounded Treewidth Graphs