A New Approach to the Maximum-Flow Problem

Journal of the ACM (JACM)

Volumn 35, Issue 4, 1988, Pages 921-940

  Goldberg, Andrew V ^a   Tarjan, Robert E ^b  

^a STANFORD UNIVERSITY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Dynamic trees; maximum flow problem

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; OPERATIONS RESEARCH;

DIRECTED GRAPHS; GRAPH ALGORITHMS; MAXIMUM-FLOW ALGORITHMS; MAXIMUM-FLOW PROBLEM; PREFLOW CONCEPT;

MATHEMATICAL TECHNIQUES;

EID: 0024090156     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/48014.61051     Document Type: Article

References (33)

1. Ahuja, R. K. and Orlin, J. B. A fast and simple algorithm for the maximum flow problem. Tech. Rep. 1905–87, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Mass., 1987.
2. Ahuja, R. K., Orlin, J. B., and Tarjan, R. E. Improved time bounds for the maximum flow problem. Unpublished mansucript.
3. Awerbuch, B. Complexity of network synchronization. J. ACM 32, 4 (Oct. 1985), 804-823.
4. Cheriyan, J., and Maheshwari, S. N. Analysis of preflow push algorithms for maximum network flow. Department of Computer Science and Engineering, Indian Institute of Tech., New Delhi, India, 1987.
5. Cherkasky, R. V. An algorithm for constructing maximal flows in networks with complexity of O(V2√E) operations. Math. Methods Solution Econ. Probl. 7(1977), 112-125. (In Russian.)
6. Dinic, E. A. Algorithm for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl. 11 (1970), 1277-1280.
7. Edmonds, J., and Karp, R. M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 2 (Apr. 1972), 248-264.
8. Even, S. Graph Algorithms. Computer Science Press, Potomac, Md., 1979.
9. Ford, L. R., Jr., and Fulkerson, D. R. Maximal flow through a network. Can. J. Math. 8 (1956), 399-404.
10. Ford, L. R., Jr., and Fulkerson, D. R. Flows in Networks. Princeton University Press, Princeton, N.J., 1962.
11. Fortune, S., and Wyllie, J. Parallelism in random access machines. In Proceedings of the 10th ACM Symposium on Theory of Computing (1978), pp. 114-118.
12. Gabow, H. N. Scaling algorithms for network problems. J. Comput. Syst. Sci. 31 (1985), 148-168.
13. Galil, Z. An O(V5/3E2/3) algorithm for the maximal flow problem. Acta Inf. 14 (1980), 221-242.
14. Galil, Z., and Naamad, A. An 0(EV log2V) algorithm for the maximal flow problem. J. Comput. Syst. Sci. 21 (1980), 203-217.
15. Gallager, R. G., Humblet, P. A., and Spira, P. M. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5, 1 (Jan. 1983), 66-77.
16. Goldberg, A. V. A new max-flow algorithm. Tech. Rep. MIT/LCS/TM-291, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass., 1985.
17. Goldberg, A. V. Efficient graph algorithms for sequential and parallel computers. PhD dissertation, Massachusetts Institute of Technology, Cambridge, Mass., Jan. 1987. Also available as Tech. Rep. TR-374, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass., 1987.
18. Goldberg, A. V., and Tarjan, R. E. A new approach to the maximum flow problem. In Proceedings of the 18th ACM Symposium on Theory of Computing. ACM, New York, 1986, pp. 136-146.
19. Goldberg, A. V., and Tarjan, R. E. Finding minimum-cost circulations by successive approximation. Math. Oper. Res., to appear.
20. Karzanov, A. V. Determining the maximal flow in a network by the method of preflows. Sov. Math. Dokl. 15 (1974), 434-437.
21. Lawler, E. L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
22. Leiserson, C., and Maggs, B. Communication-efficient parallel graph algorithms. In Proceedings of the International Conference on Parallel Processing. IEEE Computer Society Press, Silver Spring, Md., 1986, pp. 861-868.
23. Malhotra, V. M., Pramodh Kumar, M., and Maheshwari, S. N. An O(ǀVǀ3) algorithm for finding maximum flows in networks. Inf. Process. Lett. 7 (1978), 277-278.
24. Ogielski, A. T. Integer optimization and zero-temperature fixed point in Ising random-field systems. Phys. Rev. Lett. 57(1986), 1251-1254.
25. Papadimitriou, C. H., and Steiglitz, K. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, N.J., 1982.
26. Picard, J. C., and Ratliff, H. D. Minimum cuts and related problems. Networks 5 (1975), 357-370.
27. Shiloach, Y. An 0(nl log2I) maximum-flow algorithm. Tech. Rep. STAN-CS-78-802, Computer Science Dept., Stanford Univ., Stanford, Calif., 1978.
28. Shiloach, Y., and Vishkin, U. An O(n2log n) parallel max-flow algorithm. J. Algorithms 3 (1982), 128-146.
29. Sleator, D. D. An O(nm log n) algorithm for maximum network flow. Tech. Rep. STAN-CS-80-831, Computer Science Dept, Stanford Univ., Stanford, Calif., 1980.
30. Sleator, D. D., and Tarjan, R. E. A data structure for dynamic trees. J. Comput. Syst. Sci. 26 (1983), 362-391.
31. Sleator, D. D., and Tarjan, R. E. Self-adjusting binary search trees. J. ACM 32, 3 (July 1985), 652-686.
32. Tarjan, R. E. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 1983.
33. Tarjan, R. E. A simple version of Karzanov's blocking flow algorithm. Oper. Res. Lett. 2 (1984), 265-268.