An o(n3)-time maximum-flow algorithm

SIAM Journal on Computing

Volumn 25, Issue 6, 1996, Pages 1144-1170

  Cheriyan, Joseph ^a   Hagerup, Torben ^b   Mehlhorn, Kurt ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Current edge problem; Dynamic tree; Graph algorithm; Maximum flow; Network flow; Preflow push algorithm; Scaling

Indexed keywords

EID: 0343737694     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539791278376     Document Type: Article

References (21)

1. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. R. K. AHUJA AND J. B. ORLIN, A fast and simple algorithm for the maximum flow problem, Oper. Res., 37 (1989), pp. 748-759.
3. R. K. AHUJA, J. B. ORLIN, AND R. E. TARJAN, Improved time bounds for the maximum flow problem, SIAM J. Comput., 18 (1989), pp. 939-954.
4. N. ALON, Generating pseudo-random permutations and maximum flow algorithms, Inform. Process. Lett., 35 (1990), pp. 201-204.
5. J. CHERIYAN AND T. HAGERUP, A randomized maximum-flow algorithm, in Proc. 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 118-123.
6. _, A randomized maximum-flow algorithm, SIAM J. Comput., 24 (1995), pp. 203-226.
7. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1990.
8. L. R. FORD, JR., AND D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
9. A. V. GOLDBERG, Processor-efficient implementation of a maximum flow algorithm, Inform. Process. Lett., 38 (1991), pp. 179-185.
10. A. V. GOLDBERG AND R. E. TARJAN, A new approach to the maximum-flow problem, J. Assoc. Comput. Mach., 35 (1988), pp. 921-940.
11. _, A parallel algorithm for finding a blocking flow in an acyclic network, Inform. Process. Lett., 31 (1989), pp. 265-271.
12. L. M. GOLDSCHLAGER, R. A. SHAW, AND J. STAPLES, The maximum flow problem is log space complete for P, Theoret. Comput. Sci., 21 (1982), pp. 105-111.
13. M. GROTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
14. T. HAGERUP AND C. RÜB, A guided tour of Chernoff bounds, Inform. Process. Lett., 33 (1990), pp. 305-308.
15. A. V. KARZANOV, Determining the maximal flow in a network by the method of preflows, Soviet Math. Dokl., 15 (1974), pp. 434-437.
16. V. KING, S. RAO, AND R. TARJAN, A faster deterministic maximum flow algorithm, J. Algorithms, 17 (1994), pp. 447-474.
17. R. SEDGEWICK, Permutation generation methods, Comput. Surveys, 9 (1977), pp. 137-164.
18. 2 log n) parallel MAX-FLOW algorithm, J. Algorithms, 3 (1982), pp. 128-146.
19. D. D. SLEATOR AND R. E. TARJAN, A data structure for dynamic trees, J. Comput. System Sci., 26 (1983), pp. 362-391.
20. _, Self-adjusting binary search trees, J. Assoc. Comput. Mach., 32 (1985), pp. 652-686.
21. R. E. TARJAN, personal communication, September 1989.