General vertex disjoint paths in series-parallel graphs
From MaRDI portal
Publication:1208474
DOI10.1016/0166-218X(93)90035-MzbMATH Open0786.05080MaRDI QIDQ1208474FDOQ1208474
Authors: Ephraim Korach, Ady Tal 
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10)
Cites Work
- Graph theory
- A Polynomial Solution to the Undirected Two Paths Problem
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Disjoint paths in graphs
- 2-linked graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Title not available (Why is that?)
- On the Computational Complexity of Combinatorial Problems
- Graph minors. VI. Disjoint paths across a disc
- Topology of series-parallel networks
- The NP-completeness column: an ongoing guide
- Title not available (Why is that?)
- Linear-time computability of combinatorial problems on series-parallel graphs
- Title not available (Why is that?)
- Disjoint Paths—A Survey
Cited In (7)
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
- Vertex disjoint paths on clique-width bounded graphs
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Measuring the distance to series-parallelity by path expressions
- Finding k Disjoint Paths in a Directed Planar Graph
- Selecting vertex disjoint paths in plane graphs
- Vertex disjoint paths for dispatching in railways
This page was built for publication: General vertex disjoint paths in series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208474)
