The Directed Disjoint Shortest Paths Problem
From MaRDI portal
Recommendations
- The disjoint shortest paths problem
- The undirected two disjoint shortest paths problem
- Disjoint shortest paths in graphs
- Shortest edge-disjoint paths in graphs
- On the directed hop-constrained shortest path problem
- Shortest two disjoint paths in polynomial time
- Shortest two disjoint paths in polynomial time
- The Induced Disjoint Paths Problem
- The Maximum Disjoint Routing Problem
Cites work
- 2-linked graphs
- A Polynomial Solution to the Undirected Two Paths Problem
- Disjoint paths in graphs
- Distributed algorithms for computing shortest pairs of disjoint paths
- Finding k Disjoint Paths in a Directed Planar Graph
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Graph minors. XIII: The disjoint paths problem
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 16300 (Why is no real title available?)
- scientific article; zbMATH DE number 6146454 (Why is no real title available?)
- On shortest disjoint paths in planar graphs
- On the Computational Complexity of Combinatorial Problems
- Shortest \((A+B)\)-path packing via hafnian
- Shortest two disjoint paths in polynomial time
- The directed subgraph homeomorphism problem
- The disjoint paths problem in quadratic time
- The disjoint shortest paths problem
- Towards single face shortest vertex-disjoint paths in undirected planar graphs
Cited in
(30)- The disjoint shortest paths problem
- On the directed hop-constrained shortest path problem
- Exact algorithms for finding partial edge-disjoint paths
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Two disjoint shortest paths problem with non-negative edge length
- The undirected two disjoint shortest paths problem
- The directed 2-linkage problem with length constraints
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
- The Maximum Disjoint Routing Problem
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
- scientific article; zbMATH DE number 3922000 (Why is no real title available?)
- Finding k Disjoint Paths in a Directed Planar Graph
- The next‐to‐shortest path problem on directed graphs with positive edge weights
- scientific article; zbMATH DE number 1409242 (Why is no real title available?)
- Shortest k-disjoint paths via determinants
- Shortest two disjoint paths in polynomial time
- Efficient Algorithms for k-Disjoint Paths Problems on DAGs
- The 2-disjoint path problem for circulant digraphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Theory and Applications of Models of Computation
- scientific article; zbMATH DE number 7765417 (Why is no real title available?)
- Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
- Path partitions of phylogenetic networks
- Parameterizing path partitions
- Detecting disjoint shortest paths in linear time and more
- Lower bounds for approximate (\& exact) k-disjoint-shortest-paths
- Lower bounds for approximate (\& exact) \(k\)-\textsc{Disjoint-Shortest-Paths}
- Tight approximation and kernelization bounds for vertex-disjoint shortest paths
- Using a geometric Lens to find k disjoint shortest paths
- Tight approximation and kernelization bounds for vertex-disjoint shortest paths
This page was built for publication: The Directed Disjoint Shortest Paths Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111698)
