L. R. Ford, Jr.
<templatestyles src="Module:Hatnote/styles.css"></templatestyles>
Lester Randolph Ford, Jr. (born September 23, 1927, Houston) is an American mathematician specializing in network flow problems. He is the son of mathematician Lester R. Ford, Sr..[1]
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.[2][3] Ford also developed the Bellman–Ford algorithm for finding shortest paths in graphs that have negatively weighted edges before Bellman.
References
Lua error in package.lua at line 80: module 'strict' not found.
<templatestyles src="Asbox/styles.css"></templatestyles>
   |
This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |
