Revision as of 09:31, 16 November 2005 edit Zero0000 (talk \| contribs) Autopatrolled, Extended confirmed users, Administrators 43,857 edits Dinic' algorithm is more sophisticated than E-K, that's why the running time is better. ← Previous edit		Revision as of 02:21, 17 November 2005 edit undo 210.11.147.10 (talk) No edit summary Next edit →
Line 7: ==References== * E. A. Dinic, Algorithm for solution of a problem of maximum flow in a network with power estimation, ''Soviet Math. Doklady'', Vol 11 (1970) pp1277-1280. * J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for ~~networkl~~network flow problems, ''Journal of the [[Association for Computing Machinery\|ACM]]'', Vol 19, No. 2 (1972) pp248-264. [http://delivery.acm.org/10.1145/330000/321699/p248-edmonds.pdf PDF (needs subscription)] [[Category:Graph algorithms]]

Edmonds–Karp algorithm: Difference between revisions