Exact algorithms for finding partial edge-disjoint paths

DOI10.1007/978-3-319-94776-1_2MaRDI QIDQ1790948zbMATH OpenOpenAlexFDO

Authors Yunyun Deng, Longkun Guo, 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

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

Recommendations

• Finding edge-disjoint paths in partial \(k\)-trees
• The undirected two disjoint shortest paths problem
• The Directed Disjoint Shortest Paths Problem
• Two disjoint shortest paths problem with non-negative edge length
• Finding edge-disjoint paths in partial k-trees

Cited in

(11)

• On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms
• Finding edge-disjoint paths in networks: an ant colony optimization algorithm
• Algorithms for finding disjoint path covers in unit interval graphs
• BFS Solution for Disjoint Paths in P Systems
• scientific article; zbMATH DE number 2086258 (Why is no real title available?)
• scientific article; zbMATH DE number 4205963 (Why is no real title available?)
• scientific article; zbMATH DE number 2030041 (Why is no real title available?)
• An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
• An exponential time parameterized algorithm for planar disjoint paths
• A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
• Graph-Theoretic Concepts in Computer Science

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790948)