An O (n log n) algorithm for maximum st-flow in a directed planar graph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 524-533

  Borradaile, Glencora ^a   Klein, Philip ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PLANAR GRAPHS; PREPROCESSING STEP;

DISTANCE MEASUREMENT; GRAPH THEORY; OPTIMIZATION;

ALGORITHMS;

EID: 33244488008     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109615     Document Type: Conference Paper

References (25)

1. U. A. Acar, G. E. Blelloch, R. Harper, J. L. Vittes, and S. L. M. Woo. Dynamizing static algorithms, with applications to dynamic trees and history independence. In 15th SODA, pages 531-540, 2004.
2. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Maintaining information in fully-dynamic trees with top trees. http://arXiv.org/abs/cs/ 0310065, November 2003.
3. T. C. Biedl, B. Brejova, and T. Vinar. Simplifying Flow Networks. In Mogens Nielsen and Branislav Rovan, editors, Mathematical Foundations of Computer Science 2000 (MFCS), volume 1893 of Lecture Notes in Computer Science, pages 192-201, August 2000. Springer.
4. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic planar graph. J. Algorithms 13(1):33-54, 1992.
5. J. Pakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, near linear time. In 42nd FOCS, pages 232-241, 2001.
6. C. Ford and D. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 1956.
7. G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. In 32nd FOCS, pages 632-641, 1991.
8. A. V. Goldberg. Efficient Graph Algorithms for Sequential and Parallel Computers. PhD thesis, MIT, 1987.
9. R. Hassin. Maximum flows in (s,t) planar networks. IPL, 13:107, 1981.
10. 2n) algorithm for maximum flow in undirected planar networks. SIAM J. Comput., 14:612-624, 1985.
11. M. R. Henzinger, P. N. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. JCSS, 55(1):3-23, 1997.
12. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM, 46(4):502-516, 1999.
13. A. Itai and Y. Shiloach. Maximum flow in planar networks. SIAM J. Comput., 8:135-150, 1979.
14. D. B. Johnson. Efficient algorithms for shortest paths in sparse graphs. J. ACM, 24:1-13, 1977.
15. S. Khuller, J. Naor, and P. Klein. The lattice structure of flow in planar graphs. SIAM J. Disc. Math., 6(3):477-490, 1993.
16. S. Khuller and J. S. Naor. Flow in planar graphs with vertex capacities. Algorithmica, 11(3):200-225, 1994.
17. P. N. Klein. Multiple-source shortest paths in planar graphs. In 16th SODA, pages 146-155, 2005.
18. G. L. Miller and J. Naor. Flow in planar graphs with multiple sources and sinks. SIAM Journal on Computing, 24(5):1002-1017, 1995.
19. 2 n) time. SIAM Journal on Computing, 12:71-81, 1983.
20. H. Ripphausen-Lipa, D. Wagner, and K. Weihe. The vertex-disjoint menger problem in planar graphs. In 4th SODA, pages 112-119, 1993.
21. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. JCSS, 26(3):362-391, 1983.
22. D. M. Y. Sommerville. An Introduction to the Geometry of n Dimensions. Dover, 1958.
23. R. E. Tarjan and R. F. Werneck. Self-adjusting top trees. In 16th SODA, pages 813-822, 2005.
24. K. Weihe. Maximum (s, t)-flows in planar networks in O(|V|log|V|) time. JCSS, 55:454-476, 1997.
25. H. Whitney. Planar Graphs. Fund. Math., 21:73-84, 1933.