The vertex-disjoint menger problem in planar graphs

Authors:
Heike Ripphausen-Lipa;Dorothea Wagner;Karsten Weihe
Affiliations:
Fachbereich Mathematik, Sek. MA 6-1, Technische Universität, Berlin;Fachbereich Mathematik, Sek. MA 6-1, Technische Universität, Berlin;Fachbereich Mathematik, Sek. MA 6-1, Technische Universität, Berlin
Venue:
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Year:
1993

Citing 4
Cited 2

Graph algorithms

Handbook of theoretical computer science (vol. A)
Finding Steiner forests in planar graphs

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph Algorithms

Graph Algorithms
The equivalence of theorem proving and the interconnection problem

ACM SIGDA Newsletter

Efficient algorithms for finding disjoint paths in grids

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An O (n log n) algorithm for maximum st-flow in a directed planar graph

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Quantified Score

Hi-index	0.00

Visualization

Abstract