A linear time algorithm for the arc disjoint menger problem in planar directed graphs

Algorithmica (New York)

Volumn 28, Issue 1, 2000, Pages 16-36

  Brandes, U ^a   Wagner, D ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Disjoint paths; Graph algorithms; Planar graphs

Indexed keywords

EID: 8844245709     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010029     Document Type: Article

References (13)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows. Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. Harold N. Gabow and Robert E. Tarjan. A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci., 30:209-221, 1985.
3. John E. Hopcroft and Robert E. Tarjan. Efficient pfanarity testing. J. Assoc. Comput. Mach., 21:549-568, 1974.
4. Alon Itai and Yossi Shiloach. Maximum flows in planar networks. SIAM J. Comput., 8:135-150, 1979.
5. 3/2 log n) time. In Proceedings of the 20th Annual Allerton Conference on Communication, Control, and Computing, pages 898-905, 1982.
6. Samir Khuller, Joseph (Seffi) Naor, and Philip Klein. The lattice structure of flow in planar graphs. SIAM J. Discrete Math., 6(3):477-490, 1993.
7. Philip Klein, Satish B. Rao, Monika Rauch, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. System Sci., 55(1):3-23, 1997.
8. Karl Menger. Zur allgemeinen Kurventheorie. Fund. Math., 10:95-115, 1927.
9. Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe. Efficient algorithms for disjoint paths in planar graphs. In William Cook, Laszlo Lovász, and Paul Seymour, editors, Combinatorial Optimization: Papers from the DIMACS special year. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 20, pages 295-354. American Mathematical Society, Providence, RI, 1995.
10. Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe. The vertex-disjoint Menger problem in planar graphs. SIAM J. Comput., 26:331-349, 1997.
11. Karsten Weihe. Maximum (s, t)-flows in planar network in O(n logn) time. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, FOCS '94, pages 178-189, 1994.
12. Karsten Weihe. Edge-disjoint (s, t)-paths in undirected planar graphs in linear time. J. Algorithms, 23:121-138, 1997.
13. Dorothea Wagner and Karsten Weihe. A linear time algorithm for edge-disjoint paths in planar graphs. Combinatorica, 15:135-150, 1995.