The Vertex-Disjoint Menger Problem in Planar Graphs
DOI10.1137/S0097539793253565zbMATH Open0869.05059OpenAlexW1976957234MaRDI QIDQ4337639FDOQ4337639
Authors: Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe 
Publication date: 26 May 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793253565
Recommendations
- scientific article; zbMATH DE number 437535
- Maximum Edge-Disjoint Paths Problem in Planar Graphs
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs
- On the complexity of the edge-disjoint min-min problem in planar digraphs
- On shortest disjoint paths in planar graphs
- On shortest disjoint paths in planar graphs
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract)
- Edge-disjoint maximal planar graphs
- The Maximum Independent Set Problem in Planar Graphs
- Irrelevant vertices for the planar disjoint paths problem
Programming involving graphs or networks (90C35) 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)
Cited In (14)
- Title not available (Why is that?)
- Untangling planar graphs from a specified vertex position-Hard cases
- Title not available (Why is that?)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- 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
- Visibility representations of toroidal and Klein-bottle graphs
- Interdiction problems on planar graphs
- Extending convex partial drawings of graphs
- Title not available (Why is that?)
- Irrelevant vertices for the planar disjoint paths problem
- Maximum flow in directed planar graphs with vertex capacities
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
- Vertex disjoint paths for dispatching in railways
- Vertex disjoint paths in upward planar graphs
This page was built for publication: The Vertex-Disjoint Menger Problem in Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337639)
