Disjoint paths in symmetric digraphs
From MaRDI portal
Recommendations
- Disjoint A-paths in digraphs
- Disjoint paths in acyclic digraphs
- Disjoint paths in decomposable digraphs
- Disjoint paths in graphs
- scientific article; zbMATH DE number 4089593
- Disjoint paths in graphs. (Reprint)
- Disjoint directed and undirected paths and cycles in digraphs
- Disjoint paths in graphs. II: A special case
- Disjoint shortest paths in graphs
- Disjoint paths in sparse graphs
Cites work
- scientific article; zbMATH DE number 863470 (Why is no real title available?)
- A Polynomial Solution to the Undirected Two Paths Problem
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Graph Classes: A Survey
- Graph minors. XIII: The disjoint paths problem
- Multicommodity flows in certain planar directed networks
- NP-completeness of some edge-disjoint paths problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Computational Complexity of Combinatorial Problems
- On the complexity of the disjoint paths problem
- The directed subgraph homeomorphism problem
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- The subgraph homeomorphism problem
- Weak Three-Linking in Eulerian Dgraphs
Cited in
(6)- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Disjoint non-balanced \(A\)-paths in biased graphs
- Disjoint \(A\)-paths in digraphs
- Multiflows in symmetric digraphs
- Computing monotone disjoint paths on polytopes
- Edge-disjoint paths in digraphs with bounded independence number
This page was built for publication: Disjoint paths in symmetric digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003758)
