Efficient Algorithms for k-Disjoint Paths Problems on DAGs
From MaRDI portal
Publication:5434432
DOI10.1007/978-3-540-72870-2_13zbMath1137.68483MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Curvature in image and shape processing, A note on approximating the min-max vertex disjoint paths on directed acyclic graphs, 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, On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks