Efficient Algorithms for k-Disjoint Paths Problems on DAGs

DOI10.1007/978-3-540-72870-2_13zbMath1137.68483OpenAlexW1865577553MaRDI QIDQ5434432

Qi Ge, Rudolf Fleischer, Jian Li, Hong Zhu

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72870-2_13

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks ⋮ Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph ⋮ A note on approximating the min-max vertex disjoint paths on directed acyclic graphs ⋮ Curvature in image and shape processing

This page was built for publication: Efficient Algorithms for k-Disjoint Paths Problems on DAGs