research-article

Free access

Efficient maximum flow algorithms

Authors:

Andrew V. Goldberg,

Robert E. TarjanAuthors Info & Claims

Communications of the ACM, Volume 57, Issue 8

Pages 82 - 89

https://doi.org/10.1145/2628036

Published: 01 August 2014 Publication History

All formats PDF

Abstract

Though maximum flow algorithms have a long history, revolutionary progress is still being made.

References

[1]

Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River, NJ, 1993.

Digital Library

Google Scholar

[2]

Babenko, M.A., Derryberry, J., Goldberg, A.V., Tarjan, R.E., and Zhou, Y. Experimental evaluation of parametric max-flow algorithms. In Proceedings of the Sixth Workshop on Experimental Algorithms, Lecture Notes in Computer Science. Springer, Heidelberg, Germany, 2007, 256--269.

Digital Library

Google Scholar

[3]

Borradaile, G. and Klein, P.N. An O(n log n) algorithm for maximum st-flow in a directed planar graph. Journal of the ACM 56, 2 (2009), 1--34.

Digital Library

Google Scholar

[4]

Borradaile, G., Klein, P.N., Mozes, S., Nussbaum, Y., and Wulff-Nilsen, C. Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science. IEEE Press, New York, 2011, 170--179.

Digital Library

Google Scholar

[5]

Boykov, Y. and Kolmogorov, V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 9 (2004), 1124--1137.

Digital Library

Google Scholar

[6]

Cheriyan, J. and Maheshwari, S.N. Analysis of preflow push algorithms for maximum network flow. SIAM Journal on Computing 18, 6 (1989), 1057--1086.

Digital Library

Google Scholar

[7]

Cherkassky, B.V. and Goldberg, A.V. On implementing push-relabel method for the maximum flow problem. Algorithmica 19, 4 (1997), 390--410.

Crossref

Google Scholar

[8]

Christiano, P., Kelner, J.A., Madry, A., Spielman, D.A., and Teng, S-H. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In Proceedings of the Annual ACM Symposium on Theory of Computing. ACM Press, New York, 2011, 273--282.

Digital Library

Google Scholar

[9]

Dantzig, G.B. Application of the simplex method to a transportation problem. In Activity Analysis and Production and Allocation, T.C. Koopmans, Ed. John Wiley & Sons, Inc., New York, 1951, 359--373.

Google Scholar

[10]

Dinic, E.A. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematical Docladi 11 (1970), 1277--1280.

Google Scholar

[11]

Dinic, E.A. Metod porazryadnogo sokrashcheniya nevyazok i transportnye zadachi {Excess scaling and transportation problems}. In Issledovaniya po Diskretnoi. Matematike Nauka, Moscow, Russia, 1973.

Google Scholar

[12]

Edmonds, J. and Karp, R.M. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19, 2 (1972), 248--264.

Digital Library

Google Scholar

[13]

Even, S. and Tarjan, R.E. Network flow and testing graph connectivity. SIAM Journal on Computing 4, 4 (1975), 507--518.

Crossref

Google Scholar

[14]

Ford, Jr., L.R. and Fulkerson, D.R. Maximal flow through a network. Canadian Journal of Mathematics 8 (1956), 399--404.

Crossref

Google Scholar

[15]

Galil, Z. and Naamad, A. An O(EV log² V) algorithm for the maximal flow problem. Journal of Computer and System Sciences 21, 2 (1980), 203--217.

Crossref

Google Scholar

[16]

Goldberg, A.V. Two-level push-relabel algorithm for the maximum flow problem. In Proceedings of the Fifth Conference on Algorithmic Aspects in Information Management, Volume 5564 of Lecture Notes in Computer Science. Springer, Heidelberg, Germany, 2009, 212--225.

Digital Library

Google Scholar

[17]

Goldberg, A.V. and Rao, S. Beyond the flow decomposition barrier. Journal of the ACM 45, 5 (1998), 753--782.

Digital Library

Google Scholar

[18]

Goldberg, A.V. and Tarjan, R.E. A new approach to the maximum flow problem. Journal of the ACM 35, 4 (1988), 921--940.

Digital Library

Google Scholar

[19]

Goldberg, A.V. and Tarjan, R.E. Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research 15, 3 (1990), 430--466.

Digital Library

Google Scholar

[20]

Goldberg, A.V., Hed, S., Kaplan, H., Tarjan, R.E., and Werneck, R.F. Maximum flows by incremental breadth-first search. In Proceedings of the 19th European Symposium on Algorithms. Springer-Verlag, Heidelberg, Germany, 2011, 457--468.

Digital Library

Google Scholar

[21]

Karger, D.R. and Levine, M. Finding maximum flows in undirected graphs seems easier than bipartite matching. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM Press, New York, 1997.

Digital Library

Google Scholar

[22]

Karzanov, A.V. Tochnaya otzenka algoritma nakhojdeniya maksimalnogo potoka, primenennogo k aadache 'o predstavitelyakh' {The exact time bound for a maximum flow algorithm applied to the set representatives problem}. In Problems in Cibernetics 5 (1973), 66--70.

Google Scholar

[23]

Karzanov, A.V. Determining the maximal flow in a network by the method of preflows. Soviet Mathematical Dokladi 15 (1974), 434--437.

Google Scholar

[24]

Kelner, A., Lee, Y.T., Orecchia, L., and Sidford, A. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, 2014, 217--226.

Digital Library

Google Scholar

[25]

Lee, T., Rao, S., and Srivastava, N. A new approach to computing maximum flows using electrical flows. In Proceedings of the Annual ACM Symposium on Theory of Computing. ACM Press, New York, 2013, 755--764.

Digital Library

Google Scholar

[26]

Madry, A. Navigating central path with electrical flows: From flows to matchings, and back. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science. IEEE Press, New York, 2013, 253--262.

Digital Library

Google Scholar

[27]

Orlin, J.B. Max Flows in O(nm) time, or better. In Proceedings of the Annual ACM Symposium on Theory of Computing. ACM Press, New York, 765--774.

Digital Library

Google Scholar

[28]

Sherman, J. Nearly maximum flows in nearly linear time. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science. IEEE Press, New York, 2013, 263--269.

Digital Library

Google Scholar

[29]

Sleator, D.D. and Tarjan, R.E. A data structure for dynamic trees. Journal of Computer and System Sciences 26, 3 (1983), 362--391.

Digital Library

Google Scholar

[30]

Sleator, D.D. and Tarjan, R.E. Self-adjusting binary search trees. Journal of the ACM 32, 3 (1985), 652--686.

Digital Library

Google Scholar

[31]

Tarjan, R.E., Ward, J., Zhang, B., Zhou, Y., and Mao, J. Balancing applied to maximum network flow problems. In Proceedings of the 14th European Symposium on Algorithms. Springer-Verlag, Berlin, 2006, 612--623.

Digital Library

Google Scholar

Cited By

View all

Sander R(2024)MEXPLORER 1.0.0 – a mechanism explorer for analysis and visualization of chemical reaction pathways based on graph theoryGeoscientific Model Development10.5194/gmd-17-2419-202417:6(2419-2425)Online publication date: 25-Mar-2024
https://doi.org/10.5194/gmd-17-2419-2024
Xing ZHu SDing RYan TXiong XWei X(2024)Multi-sensor dynamic scheduling for defending UAV swarms with Fresnel zone under complex terrainISA Transactions10.1016/j.isatra.2024.08.004153(57-69)Online publication date: Oct-2024
https://doi.org/10.1016/j.isatra.2024.08.004
Wei WLiu YZhang Q(2024)An optimal pruned traversal tree-based fast minimum cut solver in dense graphInformation Sciences10.1016/j.ins.2023.119768652(119768)Online publication date: Jan-2024
https://doi.org/10.1016/j.ins.2023.119768
Show More Cited By

Index Terms

Efficient maximum flow algorithms

Recommendations

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 57, Issue 8

August 2014

92 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/2632661

Editor:
Moshe Y. Vardi
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 2014

Published in CACM Volume 57, Issue 8

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

77
Total Citations
View Citations
57,762
Total Downloads

Downloads (Last 12 months)926
Downloads (Last 6 weeks)129

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sander R(2024)MEXPLORER 1.0.0 – a mechanism explorer for analysis and visualization of chemical reaction pathways based on graph theoryGeoscientific Model Development10.5194/gmd-17-2419-202417:6(2419-2425)Online publication date: 25-Mar-2024
https://doi.org/10.5194/gmd-17-2419-2024
Xing ZHu SDing RYan TXiong XWei X(2024)Multi-sensor dynamic scheduling for defending UAV swarms with Fresnel zone under complex terrainISA Transactions10.1016/j.isatra.2024.08.004153(57-69)Online publication date: Oct-2024
https://doi.org/10.1016/j.isatra.2024.08.004
Wei WLiu YZhang Q(2024)An optimal pruned traversal tree-based fast minimum cut solver in dense graphInformation Sciences10.1016/j.ins.2023.119768652(119768)Online publication date: Jan-2024
https://doi.org/10.1016/j.ins.2023.119768
Behrooz HIlbeigi M(2024)Adaptive emergency evacuation routing: A graph-based approachInternational Journal of Transportation Science and Technology10.1016/j.ijtst.2024.11.010Online publication date: Dec-2024
https://doi.org/10.1016/j.ijtst.2024.11.010
Liu WLi PYao W(2024)High-precision ultra-fast minimum cut approximation through aggregated hash of cut collectionChaos, Solitons & Fractals10.1016/j.chaos.2024.115405187(115405)Online publication date: Oct-2024
https://doi.org/10.1016/j.chaos.2024.115405
Gao YLiu YPeng R(2023)Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg–RaoSIAM Journal on Computing10.1137/22M1476666(FOCS21-85-FOCS21-156)Online publication date: 26-Apr-2023
https://doi.org/10.1137/22M1476666
Fountoulakis KLiu MGleich DMahoney M(2023)Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and PerformanceSIAM Review10.1137/20M133305565:1(59-143)Online publication date: 9-Feb-2023
https://doi.org/10.1137/20M1333055
Wei HXu MGe G(2023)Robust Network Function ComputationIEEE Transactions on Information Theory10.1109/TIT.2023.329615469:11(7070-7081)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3296154
Wang PSourav SLi HChen B(2023)One Pass is Sufficient: A Solver for Minimizing Data Delivery Time over Time-varying NetworksIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228959(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228959
Alupotha J(2023)Double-Blind Proof of Existence for Decentralized IdentitiesIEEE Access10.1109/ACCESS.2023.333641011(132180-132195)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3336410
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF Chinese translation

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Implementations of the pseudoflow algorithm for maximum flow, bipartite matching, flows in unit capacity networks, and parametric maximum flow

Efficient dynamic network flow algorithms

Efficient Dynamic Network Flow Algorithms