Edmonds-Karp algorithm

It is slower than Edmonds-Karp algorithm even for very dense graphs.

Asymptotically, it is more efficient than the Edmonds-Karp algorithm, which runs in time.

There are polynomial-time methods to solve the min-cut problem, notably the Edmonds-Karp algorithm.

The algorithm runs in time and is similar to the Edmonds-Karp algorithm, which runs in time, in that it uses shortest augmenting paths.

The name "Ford-Fulkerson" is often also used for the Edmonds-Karp algorithm, which is a specialization of Ford-Fulkerson.

A variation of the Ford-Fulkerson algorithm with guaranteed termination and a runtime independent of the maximum flow value is the Edmonds-Karp algorithm, which runs in time.

In computer science and graph theory, the Edmonds-Karp algorithm is an implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network in O(V E) time.

In 1971 he co-developed with Jack Edmonds the Edmonds-Karp algorithm for solving the max-flow problem on networks, and in 1972 he published a landmark paper in complexity theory, "Reducibility Among Combinatorial Problems", in which he proved 21 Problems to be NP-complete.