Glencora Borradaile
Philip Klein
Skip Abstract Section
Abstract
We give the first correct O(n log n) algorithm for finding a maximum st-flow in a directed planar graph. After a preprocessing step that consists in finding single-source shortest-path distances in the dual, the algorithm consists of repeatedly saturating the leftmost residual s-to-t path.
- 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. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- Biedl, T., Brejová, B., and Vinař, T. 2000. Simplifying flow networks. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 192--201. Google ScholarDigital Library
- Dinitz, E. 1970. Algorithm for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl. 11, 1277--1280.Google Scholar
- Edmonds, J. 1960. A combinatorial representation for polyhedral surfaces. Notices AMS 7, 646.Google Scholar
- Edmonds, J., and Karp, R. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 2, 248--264. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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 of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1--11. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Ford, C., and Fulkerson, D. 1956. Maximal flow through a network. Canad. J. Math. 8, 399--404.Google ScholarCross Ref
- Frederickson, G. 1987. Fast algorithms for shortest paths in planar graphs with applications. SIAM J. Comput. 16, 1004--1022. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Goldberg, A., and Rao, S. 1998. Beyond the flow decomposition barrier. J. ACM 45, 5, 783--797. Google ScholarDigital Library
- Goldberg, A., and Tarjan, R. 1988. A new approach to the maximum-flow problem. J. ACM 35, 4, 921--940. Google ScholarDigital Library
- 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.Google Scholar
- Hassin, R. 1981. Maximum flow in (s,t) planar networks. Inf. Proc. Lett. 13, 107.Google ScholarCross Ref
- Hassin, R., and Johnson, D. B. 1985. An O(n log2 n) algorithm for maximum flow in undirected planar networks. SIAM J. Comput. 14, 612--624.Google ScholarCross Ref
- Heffter, L. 1891. Über das problem der nachbargebiete. Math. Ann. 38, 477--508.Google ScholarCross Ref
- Henzinger, M., and King, V. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46, 4, 502--516. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Itai, A., and Shiloach, Y. 1979. Maximum flow in planar networks. SIAM J. Comput. 8, 135--150.Google ScholarDigital Library
- Johnson, D. B. 1977. Efficient algorithms for shortest paths in sparse graphs. J. ACM 24, 1--13. Google ScholarDigital Library
- 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.Google Scholar
- Khuller, S., and Naor, J. 1994. Flow in planar graphs with vertex capacities. Algorithmica 11, 3, 200--225.Google ScholarDigital Library
- Khuller, S., Naor, J., and Klein, P. 1993. The lattice structure of flow in planar graphs. SIAM J. Disc. Math. 6, 3, 477--490. Google ScholarDigital Library
- Klein, P. N. 2005. Multiple-source shortest paths in planar graphs. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 146--155. Google ScholarDigital Library
- Kotzig, A. 1956. Súvislosť a pravidelná súvislosť konečných grafov. Ph.D. dissertation, Vysoká Škola Ekonomická, Bratislava.Google Scholar
- Miller, G. L., and Naor, J. 1995. Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24, 5, 1002--1017. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google Scholar
- Schrijver, A. 2002. On the history of the transportation and maximum flow problems. Math. Prog. 91, 3, 437--445.Google ScholarDigital Library
- Sleator, D., and Tarjan, R. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3, 362--391. Google ScholarDigital Library
- Sommerville, D. 1929. An introduction to the geometry of n dimensions. London.Google Scholar
- 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. Google ScholarDigital Library
- Weihe, K. 1997. Maximum (s, t)-flows in planar networks in O(|V|log|V|) time. J. Comput. Syst. Sci. 55, 3, 454--476. Google ScholarDigital Library
- Whitney, H. 1933. Planar graphs. Fundamenta mathematicae 21, 73--84.Google Scholar
- Youngs, J. 1963. Minimal imbeddings and the genus of a graph. J. Math. Mech. 12, 303--315.Google Scholar
Index Terms
- An O(n log n) algorithm for maximum st-flow in a directed planar graph
Recommendations
A near-linear-time algorithm for computing replacement paths in planar directed graphs
Let (G = (V(G),E(G))) be a directed graph with nonnegative edge lengths and let P be a shortest path from s to t in G. In the replacement paths problem we are required to compute for every edge e in P, the length of a shortest path from s to t that ...
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O ( n log n ) time algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the arcs. If the source and the sink are on the same face, then our ...
Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs
IPPS '91: Proceedings of the Fifth International Parallel Processing SymposiumParallel EREW deterministic algorithms for finding the connected components, ear decomposition and st-numbering of a planar graph are presented. The algorithms take O(log(n)) time with /sub log(n)///sup n+m/ processors. Previous results have the same ...
Comments