Revision as of 17:20, 9 May 2006 edit 128.2.156.92 (talk) →Complexity ← Previous edit		Revision as of 15:48, 4 June 2006 edit undo Nils Grimsmo (talk \| contribs) 567 edits Category: Network flow Next edit →
Line 124: * J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for 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~~Network ~~algorithms~~flow]] [[pt:Algoritmo de Edmonds-Karp]]

Edmonds–Karp algorithm: Difference between revisions