Jack Edmonds

Jack Edmonds
Jack Edmonds
	Edmonds with his NP rock outside his home in Ontario, Canada
Born	John Robert Edmonds; April 5, 1934; Washington, D.C., U.S.
Alma mater	University of Maryland; George Washington University; Duke University;
Known for	NP; Edmonds–Karp algorithm; Edmonds–Gallai decomposition theorem; Cobham's thesis; Blossom algorithm; Edmonds algorithm; Polymatroid; Matroid intersection; Edmonds matrix;
Awards	John von Neumann Theory Prize (1985)
	Scientific career
Fields	Computer Science, Mathematics
Institutions	University of Waterloo; National Institute of Standards and Technology;
Doctoral students	Mustafa Akgül; Gilberto Calvillo Vives; Komei Fukuda; William R. Pulleyblank; Peyton Young;

Jack R. Edmonds (born April 5, 1934) is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.