An exact characterization of tractable demand patterns for maximum disjoint path problems
From MaRDI portal
Publication:5363090
DOI10.1137/1.9781611973730.44zbMath1372.68139arXiv1411.0871OpenAlexW2953301105MaRDI QIDQ5363090
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0871
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
This page was built for publication: An exact characterization of tractable demand patterns for maximum disjoint path problems