Maximum Edge-Disjoint Paths in k-Sums of Graphs
From MaRDI portal
Publication:5326572
DOI10.1007/978-3-642-39206-1_28zbMath1336.68291arXiv1303.4897OpenAlexW1751846631MaRDI QIDQ5326572
Chandra Chekuri, F. Bruce Shepherd, Guyslain Naves
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.4897
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Approximation algorithms (68W25) Flows in graphs (05C21)
Related Items (4)
New algorithms for maximum disjoint paths based on tree-likeness ⋮ Maximum edge-disjoint paths in planar graphs with congestion 2 ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
This page was built for publication: Maximum Edge-Disjoint Paths in k-Sums of Graphs