Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Jack Edmonds

Theory of Computation

Jack R. Edmonds, born in 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 combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing, and he received the John von Neumann Theory Prize in 1985. His name is attached to Edmonds' algorithm for optimum branchings and to the blossom algorithm for matching in graphs, which he developed in 1961 and published in 1965.

Facts
Birth Year
1934 1
Connections

Credited

Source Blossom (Wikipedia)
Source Edmonds' Algorithm (Wikipedia)

In Field

Source Jack Edmonds (Wikipedia)

Invented

Source Blossom (Wikipedia)
Source Edmonds' Algorithm (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Jack Edmonds (Wikipedia)Lead section
Quote, Lead section
is an American-born and educated computer scientist and mathematician
Sources
1. Jack Edmonds (Wikipedia)
Lead section
Quote, Lead section
born April 5, 1934
View the Source
Edmonds' Algorithm (Wikipedia)
  • Credited: Edmonds' Algorithm, Lead section
    and then by Jack Edmonds (1967)
  • Invented: Edmonds' Algorithm, Lead section
    and then by Jack Edmonds (1967)
View the Source
Blossom (Wikipedia)
  • Credited: Blossom Algorithm, Lead section
    The algorithm was developed by Jack Edmonds in 1961, and published in 1965
  • Invented: Blossom Algorithm, Lead section
    The algorithm was developed by Jack Edmonds in 1961, and published in 1965
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.