D. R. Fulkerson
From Wikipedia, the free encyclopedia
Delbert Ray Fulkerson (August 14, 1924 - January 10, 1976) was a mathematician who co-developed the Ford-Fulkerson algorithm, one of the most used algorithms to compute maximal flows in networks.
Fulkerson received his Ph.D. at the University of Wisconsin-Madison in 1951. In 1956, he published his noted paper on the Ford-Fulkerson algorithm[1] together with Lester Randolph Ford. In 1979, the renowned Fulkerson Prize was established which is now awarded every three years for outstanding papers in discrete mathematics jointly by the Mathematical Programming Society and the American Mathematical Society.
[edit] Mathematical Genealogy
E. H. Moore advised L. E. Dickson advised Cyrus MacDuffee advised Fulkerson.
[edit] External links
[edit] References
- ^ L. R. Ford; D. R. Fulkerson (1962). Flows in Networks. Princeton, NJ: Princeton University Press.
 |
This article about a mathematician is a stub. You can help Wikipedia by expanding it. |
