The Ford –Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum flow in a flow network. It was published in 1956. The name "Ford –Fulkerson" is often also used for the Edmond
(Redirected from Ford–Fulkerson algorithm) Jump to: navigation, search The Ford–Fulkerson method is a technique for solving the maximum flow problem. The input is a flow network, . Then the algorithm proceeds as follows: Start with the empty flow, for all . The corresponding residual ...
(widest path) in a network is different than the problem of finding the maximum flow through a network presented by Ford and Fulkerson [282]; furthermore, Pollack made the astute observation that a shortest path routing algorithm can be slightly changed to work for widest path routing using ...
The Ford –Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum flow in a flow network. It was published in 1956. The name "Ford –Fulkerson" is often also used for the Edmonds –Karp algorithm, which is a specialization of Ford –Fulkerson.The ...