The disjoint shortest paths problem
From MaRDI portal
Recommendations
Cites work
- A Polynomial Solution to the Undirected Two Paths Problem
- Disjoint Paths—A Survey
- Disjoint paths in graphs
- Finding k Disjoint Paths in a Directed Planar Graph
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Finding disjoint paths with different path-costs: Complexity and algorithms
- Graph minors. IX: Disjoint crossed paths
- Graph minors. VI. Disjoint paths across a disc
- Graph minors. VII: Disjoint paths on a surface
- Integer plane multiflows with a mixed number of demands
- On Odd Cuts and Plane Multicommodity Flows
- On orientations and shortest paths
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Computational Complexity of Combinatorial Problems
- On the complexity of the disjoint paths problem
- Planar Formulae and Their Uses
- The complexity of finding maximum disjoint paths with length constraints
- The complexity of finding two disjoint paths with min-max objective function
- The directed subgraph homeomorphism problem
Cited in
(55)- Finding disjoint paths with different path-costs: Complexity and algorithms
- Shortest paths with exclusive-disjunction arc pairs conflicts
- The Maximum Disjoint Routing Problem
- The directed 2-linkage problem with length constraints
- Eulerian disjoint paths problem in grid graphs is NP-complete
- On shortest disjoint paths in planar graphs
- Parameterized complexity of \((A,\ell)\)-path packing
- Dynamic routing and wavelength assignment for multi-lightpath demands
- Two edge-disjoint paths with length constraints
- The widestk-set of disjoint paths problem
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- On finding Min-Min disjoint paths
- The Induced Disjoint Paths Problem
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
- scientific article; zbMATH DE number 7678024 (Why is no real title available?)
- The complexity of finding two disjoint paths with min-max objective function
- Shortest Paths between Shortest Paths and Independent Sets
- Computing disjoint paths with length constraints
- Complexity of a classical flow restoration problem
- Shortest two disjoint paths in polynomial time
- STACS 2004
- scientific article; zbMATH DE number 3922000 (Why is no real title available?)
- scientific article; zbMATH DE number 7561324 (Why is no real title available?)
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results
- Redundancy system design for an aircraft door management system
- The Directed Disjoint Shortest Paths Problem
- Theory and Applications of Models of Computation
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Shortest two disjoint paths in polynomial time
- BFS Solution for Disjoint Paths in P Systems
- On the complexity of the edge-disjoint min-min problem in planar digraphs
- On the descriptive complexity of the two disjoint paths problem over undirected graphs
- Simple undirected two-commodity integral flow with a unitary demand
- Faster 2-Disjoint-Shortest-Paths Algorithm
- A percolation model of mobile ad-hoc networks
- Almost disjoint paths and separating by forbidden pairs
- Shortest edge-disjoint paths in graphs
- Reactive synthesis without regret
- Complexity of pairwise shortest path routing in the grid
- On shortest disjoint paths in planar graphs
- A note on \(k\)-shortest paths problem
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- Two disjoint shortest paths problem with non-negative edge length
- Walking through waypoints
- Finding two edge-disjoint paths with length constraints
- Heuristics for finding a maximum number of disjoint bounded paths
- Solving the 2-disjoint paths problem in nearly linear time
- Inserting an edge into a geometric embedding
- The undirected two disjoint shortest paths problem
- On graphs coverable by \({k}\) shortest paths
- Complexity and approximation results for the min-sum and min-max disjoint paths problems
- Inserting an edge into a geometric embedding
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
This page was built for publication: The disjoint shortest paths problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392552)
