The vertex-disjoint menger problem in planar graphs

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 331-349

  Ripphausen Lipa, Heike ^a   Wagner, Dorothea ^b   Weihe, Karsten ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Disjoint paths; Graph algorithms; Planar graphs

Indexed keywords

EID: 0043161651     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793253565     Document Type: Article

References (17)

1. P. ELIAS, A. FEINSTEIN, AND C. SHANNON, Note on maximum flow through a network, IRE Trans. Inform. Theory, IT-2 (1956), pp. 117-119.
2. S. EVEN, Graph Algorithms, Pitman, Boston, 1979.
3. S. EVEN AND R. TARJAN, Network flow and testing graph connectivity, SIAM J. Comput., 4 (1975), pp. 507-518.
4. L. FORD AND D. FULKERSON, Maximal flow through a network, Canad. J. Math., 8 (1956), pp. 399-404.
5. L. FORD AND D. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
6. 2 n) algorithm for maximum flows in undirected planar networks, SIAM J. Comput., 14 (1985), pp. 612-624.
7. A. ITAI AND Y. SHILOACH, Maximum flows in planar networks, SIAM J. Comput., 8 (1979), pp. 135-150.
8. S. KHULLER AND J. NAOR, Flow in planar graphs with vertex capacities, Algorithmica, 11 (1994), pp. 200-225.
9. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley, New York, 1990.
10. 3|) algorithm for finding maximum flows in networks, Inform. Process. Lett., 7 (1978), pp. 277-278.
11. C. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
12. B. REED, N. ROBERTSON, A. SCHRIJVER, AND P. SEYMOUR, Finding disjoint trees in graphs on surfaces, in Graph Structure Theory: Proc. AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, AMS, Providence, RI, 1993, pp. 295-301.
13. 2 n) time, SIAM J. Comput., 12 (1981), pp. 71-81.
14. H. RIPPHAUSEN-LIPA, D. WAGNER, AND K. WEIHE, Linear time algorithm for disjoint two-face paths problems in planar graphs, in Algorithms and Computation, 4th International Symposium (ISAAC '93), K. Ng, P. Raghavan, N. Balasubramanian, and F. Chin, eds., Lecture Notes in Comput. Sci. 762, Springer-Verlag, Berlin, 1993, pp. 343-352.
15. H. RIPPHAUSEN-LIPA, D. WAGNER, AND K. WEIHE, Efficient algorithms for disjoint paths in planar graphs, in DIMACS Series in Discrete Mathematics and Computer Science, Vol. 20, W. Cook, L. Lovász, and P. Seymour, eds., Springer-Verlag, Berlin, pp. 295-354.
16. H. SUZUKI, T. AKAMA, AND T. NISHIZEKI, Finding Steiner forests in planar graphs, in Proc. 1st ACM-SIAM Symposium on Discrete Algorithms (SODA '90), SIAM, Philadelphia, 1990, pp. 444-453.
17. K. WEIHE, Edge-disjoint (s, t)-paths in undirected planar graphs in linear time, in Proc. 2nd European Symposium on Algorithms (ESA '94), J. Leeuwen, ed., Lecture Notes in Comput. Sci. 855, Springer-Verlag, Berlin, 1994, pp. 130-140.