Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 121-138

  Weihe, Karsten ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347419644     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0831     Document Type: Article

References (18)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, Network flows, in "Handbooks in Operations Research and Management Science," (George L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, eds.), Vol. 1, North-Holland, Amsterdam, 1989.
2. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, "Network flows," Prentice-Hall, 1993.
3. L. R. Ford and D. R. Fulkerson, "Flows in networks," Princeton Univ. Press, Princeton, 1962.
4. Greg N. Frederickson, Fast algorithms for shortest paths in planar graphs with applications, SIAM J. Comput. 16 (1987), 1004-1022.
5. Harold N. Gabow and Robert E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. Syst. Sci. 30 (1985), 209-221.
6. Refael Hassin, Maximum flows in (s, t) planar networks, Inform. Process. Lett. 13 (1981), 107.
7. 2 n) algorithm for maximum flow in undirected planar networks, SIAM J. Comput. 14 (1985), 612-624.
8. John E. Hopcroft and Robert E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21 (1974), 549-568.
9. Alon Itai and Yossi Shiloach, Maximum flows in planar networks, SIAM J. Comput. 8 (1979), 135-150.
10. Samir Khuller, J. Naor, and Philip Klein, The lattice structure of flow in planar graphs, SIAM J. Discrete Math. 30 (1993), 477-490.
11. Philip Klein, Satish B. Rao, Monika Rauch-Henzinger, and S. Subramanian, Faster shortest-path algorithms for planar graphs, in "Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94," 1994.
12. 2 n) time, SIAM J. Comput. 12 (1981), 71-81.
13. Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe, The vertexdisjoint Menger-problem in planar graphs, in "Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93," 1993, pp. 112-119.
14. Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe, Efficient algorithms for disjoint paths in planar graphs, in "DIMACS Series in Discr. Math, and Comp. Sci.," (William Cook, Laszlo Lovász, and Paul Seymour, eds.), Vol. 20, pp. 295-354, American Mathematical Society, 1995.
15. Robert E. Tarjan, Data structures and network algorithms, SIAM, 1986.
16. Karsten Weihe, Multicommodity flows in even, planar networks, in "Algorithms and Computation, 4th International Symposium, ISAAC "93," (K. W. Ng, Prabhaker Raghavan, N. V. Balasubramanian, and F. Y. L. Chin, eds.), pp. 333-342, Springer-Verlag, Lecture Notes in Computer Science, Vol. 762, 1993.
17. Karsten Weihe, Maximum (s, t)-flows in planar network in O(n log n) time, in "Proceedings of the 35th Annual Symposium on Foundations of Computer Science, FOCS'94," 1994, pp. 178-189.
18. Dorothea Wagner and Karsten Weihe, A linear time algorithm for edge-disjoint paths in planar graphs, Combinatorica 15 (1995), 135-150.