Exact algorithms for finding partial edge-disjoint paths

DOI10.1007/978-3-319-94776-1_2OpenAlexW2810179156MaRDI QIDQ1790948

Longkun Guo, Yunyun Deng, Peihuang Huang

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_2

zbMATH Keywords

directed acyclic graphexact algorithmpartial edge-disjoint pathrestricted shortest path

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms

This page was built for publication: Exact algorithms for finding partial edge-disjoint paths