A Fast And Simple Algorithm for the Maximum Flow Problem
A Fast And Simple Algorithm for the Maximum Flow Problem
Ravindra K Ahuja
The book A Fast And Simple Algorithm for the Maximum Flow Problem was written by author Ravindra K Ahuja Here you can read free online of A Fast And Simple Algorithm for the Maximum Flow Problem book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is A Fast And Simple Algorithm for the Maximum Flow Problem a good or bad book?
What reading level is A Fast And Simple Algorithm for the Maximum Flow Problem book?
To quickly assess the difficulty of the text, read a short excerpt:
Tucker, Annals of Mathematics Study 38, Princeton University Press, 215-221. Dinic, E. A. 1970. Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation, Soviet Math. Dokl. 11, 1277-1280. Edmonds, J. , and R. M. Karp. 1972. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. /. Assoc. Comput Mach. 19, 248-264. Ford, L. R. , and D. R. Fulkerson. 1956. Maximal Flow through a Network. Can. J. Math. 8, 399-404. 24 Ford, L. R. , and D. R. Fulker...son. 1962. Flows in Networks. Princeton University Press, Princeton, New Jersey. Fulkerson, D. R. , and G. B. Dantzig. 1955. Computations of Maximum Flow in Networks. Naval Res. Log. Quart. 2, 277-283. Gabow, H. N. 1985. Scaling Algorithms for Network Problems. /. Of Comput. System Sci. 31, 148-168. Gabow, H. N. , and R. E. Tarjan. 1987. Faster Scaling Algorithms for Graph Matching. Research Report, Computer Science Dept. , Princeton University, Princeton, New Jersey. Galil, Z. 1980. An 0(v5/3 E^/S) Algorithm for the Maximal Row Problem, Acta Informatica 14, 221-242.
User Reviews: