The Vertex-Disjoint Menger Problem in Planar Graphs
From MaRDI portal
Publication:4337639
DOI10.1137/S0097539793253565zbMath0869.05059OpenAlexW1976957234MaRDI QIDQ4337639
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
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Extending convex partial drawings of graphs, Visibility representations of toroidal and Klein-bottle graphs, Maximum flow in directed planar graphs with vertex capacities, Finding edge-disjoint paths in networks: an ant colony optimization algorithm, A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works