Revision as of 06:11, 11 November 2005 edit Pkirlin (talk \| contribs) Extended confirmed users 766 edits mNo edit summary ← Previous edit		Revision as of 03:02, 16 November 2005 edit undo Nkojuharov (talk \| contribs) 33 edits No edit summary Next edit →
Line 3: The Edmonds-Karp algorithm runs in [[Big O notation\|O]](VE<sup>2</sup>) time, where V is the number of vertices and E is the number of edges in the network. The Edmonds-Karp algorithm was elucidated in the 1972 paper "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems," by [[Jack Edmonds]] and [[Richard Karp]], in the ''Journal of the [[Association for Computing Machinery\|ACM]]''. In reality, however, the algorithm was first discovered by a Russian scientist, Dinits, in 1970. ==External link==

Edmonds–Karp algorithm: Difference between revisions