Maximum (s, t) - Flows in Planar Networks in script O sign (\V\ log \V\) Time

Journal of Computer and System Sciences

Volumn 55, Issue 3, 1997, Pages 454-475

  Weihe, Karsten ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

MAXIMUM FLOW;

GRAPH THEORY;

EID: 0031372794     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1538     Document Type: Article

References (15)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flows," Paramount, Amarillo, TX, 1993.
2. C. Berge, Two theorems in graph theory, in "Proc. Nat. Acad. Sci. U.S.A." Vol. 43, (1957), pp. 842-844.
3. P. Elias, A. Feinstein, and C. E. Shannon, Note on maximum flow through a network, IRE Trans. Inform. Theory IT-2 (1956), 117-119.
4. L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Can. J. Math. 8 (1956), 399-404.
5. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, J. of the Association for Computing Machinery 35 (1988), 921-940.
6. 2 n) algorithm for maximum flow in undirected planar networks, SIAM J. Comput. 14 (1985), 612-624.
7. J. E. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. of the Association for Computing Machinery 21 (1974), 549-568.
8. T. C. Hu, "Integer programming and network flows," Addison-Wesley, Reading, MA, 1969.
9. A. Itai and Y. Shiloach, Maximum flows in planar networks, SIAM J. Comput. 8 (1979), 135-1979.
10. 3/2 log n) time, in "Proceedings, 20th Annu. Allerton Conf. Comm., Control, and Comp., 1982," pp. 898-905.
11. S. Khuller, J. Naor, and P. Klein, The lattice structure of flow in planar graphs, SIAM J. Discrete Math. (1993), 477-490.
12. P. Klein, S. B. Rao, M. 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, 1993".
13. T. Nishizeki and N. Chiba, "Planar Graphs: Theory and Algorithms," Ann. Discrete Math., Vol. 32, North-Holland, Amsterdam, 1988.
14. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. of Computer and System Sciences 26 (1983), 362-391.
15. K. Weihe, Edge-disjoint (s, t)-paths in undirected planar graphs in linear time, J. of Algorithms 23 (1997), 121-138.