A namesake of this algorithm generalized it to devise the out-of-kilter algorithm.
A namesake of this algorithm generalized it to devise the out-of-kilter algorithm. The super- complex, probably never-implemented Orlin's algorithm works by starting with the theorem this algorithm proved and combining black boxes to achieve a runtime improvement of "big O of E times V." Uri Zwick was the first to show that this algorithm will never terminate for some inputs that are irrational numbers. By using the correctness proof of this algorithmÂ—which only works on so-called "one-commodity" problemsÂ—one can derive the integrality theorem, which states that if all capacities are integers, then each component of the solution being sought will beinteger valued. The Edmonds-Karp algorithm works by combining this algorithm with a breadth- first search and using a residual network. The first algorithm for computing the maximum flowof a graph was, for 10 points, what algorithm named for its two devisers? 
A namesake of this algorithm generalized it to devise the out-of-kilter algorithm.
Ford-Fulkerson algorithm