- Jack Edmonds
Jack R. Edmonds is a
mathematician , regarded as one of the most important contributors to the field ofcombinatorial optimization . He was the recipient of the 1985John von Neumann Theory Prize .From 1969 on, with the exception of 1991-1993, he held a faculty position at the Department of Combinatorics and Optimization at the
University of Waterloo 's Faculty of Mathematics. Edmonds retired in 1999.From 1991 to 1993, he was involved in a dispute ("the Edmonds affair") [ [http://communications.uwaterloo.ca/Gazette/1992/Gazette,%20October%207,%201992/CAUT%20called%20in%20on%20Jack%20Edmonds%20case CAUT called in on Jack Edmonds case] ] with the University of Waterloo. The university claimed he had resigned, but he denied it. The conflict was resolved in 1993, and he returned to the university.
The Fifth Aussois Workshop on Combinatorial Optimization in 2001 was dedicated to Jack Edmonds.
Edmonds' matching algorithm and the research paper which describes this algorithm is one of the most cited papers. The
Edmonds-Gallai decomposition theorem describes finite graphs from the point of view of matchings.He introduced
polymatroid s, blockers and cutters.His son, Jeff Edmonds, is a Professor of Computer Science at
York University in Canada.ee also
*
Chu–Liu/Edmonds algorithm
*Edmonds-Karp algorithm References
External links
* [http://nvl.nist.gov/pub/nistpubs/sp958-lide/html/140-144.html Paths, Trees, and Flowers]
*
* [http://canalc2.u-strasbg.fr/video.asp?idvideo=7551 Jack Edmonds at the TGGT 2008 international conference : Topological and Geometric Graph Theory]
Wikimedia Foundation. 2010.
