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

Journal of the ACM

Volumn 56, Issue 2, 2009, Pages

  Borradaile, Glencora ^a   Klein, Philip ^a  

^a Brown Univerity   (United States)

Author keywords

Maximum flow; Planar graphs

Indexed keywords

MAXIMUM FLOW; PLANAR GRAPH; PLANAR GRAPHS; PRE-PROCESSING STEP; SHORTEST-PATH;

GRAPH THEORY;

EID: 70349972977     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1502793.1502798     Document Type: Conference Paper

References (37)

1. ACAR, U., BLELLOCH, G., HARPER, R., VITTES,J., AND Woo, S. 2004. Dynamizing static algorithms, with applications to dynamic trees and history independence. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 531-540.
2. ALSTRUP, S., HOLM,J., DE LICHTENBERG, K., AND THORUP, M. 2005. Maintaining information in fully dynamic trees with top trees. ACM Trans. Algor. 1, 2, 243-264.
3. BIEDL, T., BrejovÁ, B., AND VinaŘ, T. 2000. Simplifying flow networks. In Proceedings of the 25th International Symposium onMathematical Foundations of Computer Science. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 192-201.
4. DINITZ, E. 1970. Algorithm for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl. 11, 1277-1280.
5. EDMONDS, J. 1960. A combinatorial representation for polyhedral surfaces. Notices AMS 7, 646.
6. EDMONDS, J., AND KARP, R. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 2, 248-264.
7. ELIAS, P., FEINSTEIN, A., AND SHANNON, C. 1956. A note on the maximum flow through a network. IEEE Trans. Inf. Theory 2, 4, 117-119.
8. EPPSTEIN, D., ITALIANO, G., TAMASSIA, R., TARJAN, R., WESTBROOK,J., and YUNG, M. 1990. Maintenance of a minimum spanning forest in a dynamic planar graph. In Proceedings ofthe 1st Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1-11.
9. FAKCHAROENPHOL,J., AND RAO, S. 2001. Planar graphs, negative weight edges, shortest paths, near linear time. In Proceedings of the 42th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 232-241.
10. FORD,C., AND FULKERSON, D. 1956. Maximal flow through a network. Canad. J. Math. 8, 399-404.
11. FREDERICKSON, G. 1987. Fast algorithms for shortest paths in planar graphs with applications. SIAM J. Comput. 16, 1004-1022. (Pubitemid 18535099)
12. GOLDBERG, A. 1998. Recent developments in maximum flow algorithms. In Proceedings of the 6th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, 1-10.
13. GOLDBERG, A., AND RAO, S. 1998. Beyond the flow decomposition barrier. J. ACM 45, 5, 783-797.
14. GOLDBERG, A., AND TARJAN, R. 1988. A new approach to the maximum-flow problem. J. ACM 35, 4, 921-940.
15. HARRIS, T., AND ROSS, F. 1955. Fundamentals of a method for evaluating rail net capacities. Research Memorandum RM-1573, The RAND Corporation, Santa Monica, CA.
16. HASSIN, R. 1981. Maximum flow in (s, t) planar networks. Inf. Proc. Lett. 13, 107.
17. HASSIN, R., AND JOHNSON, D. B. 1985. An O(n log2 n) algorithm for maximum flow in undirected planar networks. SIAMJ. Comput. 14, 612-624.
18. HEFFTER, L. 1891. Über das problem der nachbargebiete. Math. Ann. 38, 477-508.
19. HENZINGER, M., AND KING, V. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46, 4, 502-516.
20. HENZINGER, M. R., KLEIN, P. N., RAO, S., AND SUBRAMANIAN, S. 1997. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55, 1, 3-23.
21. ITAI, A., AND SHILOACH, Y. 1979. Maximum flow in planar networks. SIAM J. Comput. 8, 135-150.
22. JOHNSON, D. B. 1977. Efficient algorithms for shortest paths in sparse graphs. J. ACM 24, 1-13.
23. JOHNSON,D.B., AND VENKATESAN, S. 1982. Using divide and conquer to find flows in directed planar networks in O (n3/2 log n) time. In Proceedings of the 20th Annual Allerton Conference on Communication, Control, and Computing. 898-905.
24. KHULLER, S., AND NAOR, J. 1994. Flow in planar graphs with vertex capacities. Algorithmica 11, 3, 200-225.
25. KHULLER, S., NAOR,J., AND KLEIN, P. 1993. The lattice structure of flow in planar graphs. SIAM J. Disc. Math. 6, 3, 477-490.
26. KLEIN, P. N. 2005. Multiple-source shortest paths in planar graphs. In Proceedings ofthe 16th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 146-155.
27. KOTZIG, A. 1956. Súvislosť a pravidelná súvislosť konečných grafov. Ph.D. dissertation, Vysoká Škola Ekonomická, Bratislava.
28. MILLER, G.L., AND NAOR, J. 1995. Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24, 5, 1002-1017.
29. REIF, J. 1983. Minimum s-t cut of a planar undirected network in O(n log2 n) time. SIAM Journal on Computing 12, 71-81.
30. RIPPHAUSEN-LIPA, H., WAGNER, D., AND WEIHE, K. 1995. Efficient algorithms for disjoint paths in planar graphs. In Combinatorial Optimization, W. Cook, L. Lovasz, and P. Seymour, Eds. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.20. AMS, 295-354.
31. SCHRIJVER, A. 2002. On the history of the transportation and maximum flow problems. Math. Prog. 91, 3, 437-445.
32. SLEATOR, D., AND TARJAN, R. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3, 362-391.
33. SOMMERVILLE, D. 1929. An introduction to the geometry of n dimensions. London.
34. TARJAN, R., AND WERNECK, R. 2005. Self-adjusting top trees. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 813-822.
35. WEIHE, K. 1997. Maximum (s, t)-flows in planar networks in O(|V|log|V|) time. J. Comput. Syst. Sci. 55, 3, 454-476.
36. WHITNEY, H. 1933. Planar graphs. Fundamenta mathematicae 21, 73-84.
37. YOUNGS, J. 1963. Minimal imbeddings and the genus of a graph. J. Math. Mech. 12, 303-315.