Description
Lester Randolph Ford, Jr. is an American mathematician specializing in network flow problems. He is the son of mathematician Lester R. Ford, Sr..
Ford's paper with D. R. Fulkerson on the maximum flow problem and the Ford?Fulkerson algorithm for solving it, published as a technical report in 1954 and in a journal in 1956, established the max-flow min-cut theorem. With Richard Bellman, Ford also developed the Bellman?Ford algorithm for finding shortest paths in graphs that have negatively weighted edges. [More at Wikipedia]
Born
September 23rd, 1927 in Houston (Age 97)
Last Changes
2020/06/29
New Address: Available to members only
2020/06/29
Address Removed: Available to members only
2019/03/07
New Address: Available to members only