D. R. FULKERSON
'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 famous 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.
E. H. Moore advised L. E. Dickson advised Cyrus MacDuffee advised 'Fulkerson' advised Robert Bland and David B. Weinberger
★ Delbert Ray Fulkerson prize
Fulkerson received his Ph.D. at the University of Wisconsin-Madison in 1951. In 1956, he published his famous 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.
| Contents |
| Mathematical Genealogy |
| External link |
Mathematical Genealogy
E. H. Moore advised L. E. Dickson advised Cyrus MacDuffee advised 'Fulkerson' advised Robert Bland and David B. Weinberger
External link
★ Delbert Ray Fulkerson prize
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
Español