Dinitz' algorithm: The original version and even's version

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3895 LNCS, Issue , 2006, Pages 218-240

  Dinitz, Yefim ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; INFORMATION ANALYSIS; OPTIMIZATION;

COMPUTER SCIENCE COMMUNITY; DIME'S ALGORITHMS; MAX-FLOW ALGORITHM;

INFORMATION TECHNOLOGY;

EID: 37149049838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11685654_10     Document Type: Article

References (34)

1. G.M. Adel'son-Vel'sky and E.M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady 3 (1962), 1259-1263.
2. L.R. Ford and D.R. Fulkerson. Flows in networks. Princeton University Press, Princeton, NJ, 1962.
3. V.L. Arlazarov, E.A. Dinic, M.A. Kronrod, and I.A. Faradjev. On economical finding of transitive closure of a graph. Doklady Akademii Nauk SSSR 194 (1970), no. 3
4. (in Russian; English transl.: Soviet Mathematics Doklady 11 (1970), 1270-1272).
5. E.A. Dinic. An algorithm for the solution of the max-flow problem with the polynomial estimation. Doklady Akademii Nauk SSSR 194 (1970), no. 4
6. (in Russian; English transl.: Soviet Mathematics Doklady 11 (1970), 1277-1280).
7. J. Edmonds and R.M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. of ACM 19 (1972), 248-264.
8. E.A. Dinic. An efficient algorithm for the solution of the generalized set representatives problem. In: Voprosy Kibernetiki. Proc. of the Seminar on Combinatorial Mathematics (Moscow, 1971). Scientific Council on the Complex Problem "Kibernetika", Akad. Nauk SSSR, 1973, 49-54 (in Russian).
9. A.V. Karzanov. An exact time bound for a max-flow finding algorithm applied to the "representatives" problem. In: Voprosy Kibernetiki. Proc. of the Seminar on Combinatorial Mathematics (Moscow, 1971). Scientific Council on the Complex Problem "Kibernetika", Akad. Nauk SSSR, 1973, 66-70 (in Russian).
10. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. on Computing 2 (1973), 225-231.
11. A.V. Karzanov. Determining the maximum flow in the network by the method of preflows. Doklady Akademii Nauk SSSR 215 (1974), no. 1
12. (in Russian; English transl.: Soviet Mathematics Doklady 15 (1974), 434-437).
13. G.M. Adel'son-Vel'sky, E.A. Dinic, and A.V. Karzanov. Network flow algorithms. "Nauka", Moscow, 1975, 119 p. (in Russian; a review in English see in [25]).
14. S. Even and R.E. Tarjan. Network flow and testing graph connectivity. SIAM J. on Computing 4 (1975), 507-518.
15. 2√p). In: Mathematical Methods for Solving Economic Problems, issue 7 (1977), "Nauka", Moscow, 117-126 (in Russian).
16. B.V. Cherkassky. A fast algorithm for constructing a maximum flow through a network. In Combinatorial Methods in Network Flow Problems. VNIISI, Moscow, 1979, 90-96
17. (in Russian; English transl: Amer. Math. Soc. Transl 158 (1994), no. 2, 23-30).
18. S. Even. Graph Algorithms. Computer Science Press, Rockville, MD, 1979.
19. 2/3) algorithm for the maximal flow problem. Acta Inf. 14 (1980), 221-242.
20. 2 V) algorithm for the maximal flow problem. J. Comput. Syst. Sci. 21 (1980), no. 2, 203-217.
21. Z. Galil. On the theoretical efficiency of various network flow algorithms. Theor. Comp. Sci. 14 (1981), 103-111.
22. 2 log n) parallel max-flow algorithm. J. of Algorithms 3 (1982), 128-146.
23. D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci. 24 (1983), 362-391.
24. A.V. Goldberg. A new max-flow algorithm. TR MIT/LCS/TM-291, Laboratory for Comp. Sci., MIT, Cambridge, MA, 1985.
25. R.E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6 (1985), no.2, 306-318.
26. A.V. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. In: Proc. of the 18th ACM Symp. on the Theory of Computing (1986), 136-146.
27. Full paper in J. of ACM 35 (1988), 921-940.
28. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill, New York, NY, 1990.
29. A.V. Goldberg and R.E. Tarjan. Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research, 15 (1990), issue 3, 430-466.
30. A.V. Goldberg and D. Gusfield. Book Review: Flow algorithms by G.M. Adel'son-Vel'sky, E.A. Dinits, and A.V. Karzanov. SIAM Reviews 33 (1991), no. 2, 306-314.
31. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, NJ, 1993.
32. B.V. Cherkassky and A.V. Goldberg. On implementing the push-relabel method for the maximum flow problem. Algorithmica 19 (1997), 390-410.
33. A.V. Goldberg. Recent developments in maximum flow algorithms (invited lecture). In: Proc. of the 6th Scandinavian Workshop on Algorithm Theory (SWAT'98), LNCS 1432, Springer-Verlag, London, UK, 1998, 1-10.
34. A.V. Goldberg and S. Rao. Beyond the flow decomposition barrier. Journal of ACM 45 (1998), 753-782.