Jack Edmonds
E670991
Jack Edmonds is a pioneering Canadian mathematician and computer scientist renowned for his foundational work in combinatorial optimization and polyhedral theory, including the development of efficient algorithms for matching and matroid intersection.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Jack Edmonds canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7535388 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Jack Edmonds Context triple: [Edmonds, hasNotableBearer, Jack Edmonds]
-
A.
Robert W Floyd
Robert W. Floyd was an influential American computer scientist and Turing Award laureate known for his pioneering work in algorithms, formal verification, and programming language semantics.
-
B.
John Kruskal
John Kruskal was an American mathematician and computer scientist best known for Kruskal's algorithm in graph theory and for foundational work in combinatorics and statistics.
-
C.
John E. Hopcroft
John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
-
D.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
E.
F. M. Fulkerson
F. M. Fulkerson is a central figure in William Dean Howells’s novel "A Hazard of New Fortunes," known as the energetic, entrepreneurial promoter who helps launch the magazine around which much of the story revolves.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Jack Edmonds Target entity description: Jack Edmonds is a pioneering Canadian mathematician and computer scientist renowned for his foundational work in combinatorial optimization and polyhedral theory, including the development of efficient algorithms for matching and matroid intersection.
-
A.
Robert W Floyd
Robert W. Floyd was an influential American computer scientist and Turing Award laureate known for his pioneering work in algorithms, formal verification, and programming language semantics.
-
B.
John Kruskal
John Kruskal was an American mathematician and computer scientist best known for Kruskal's algorithm in graph theory and for foundational work in combinatorics and statistics.
-
C.
John E. Hopcroft
John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
-
D.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
E.
F. M. Fulkerson
F. M. Fulkerson is a central figure in William Dean Howells’s novel "A Hazard of New Fortunes," known as the energetic, entrepreneurial promoter who helps launch the magazine around which much of the story revolves.
- F. None of above. chosen
Statements (42)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
mathematician ⓘ |
| awardReceived |
CRM-Fields-PIMS Prize
NERFINISHED
ⓘ
Delbert Ray Fulkerson Prize NERFINISHED ⓘ John von Neumann Theory Prize NERFINISHED ⓘ Order of Canada ⓘ |
| countryOfCitizenship | Canada ⓘ |
| educatedAt | University of Waterloo NERFINISHED ⓘ |
| employer |
National Bureau of Standards
NERFINISHED
ⓘ
University of Waterloo NERFINISHED ⓘ |
| fieldOfWork |
combinatorial optimization
ⓘ
graph theory ⓘ operations research ⓘ polyhedral combinatorics ⓘ theoretical computer science ⓘ |
| gender | male ⓘ |
| influenced |
Alexander Schrijver
NERFINISHED
ⓘ
László Lovász NERFINISHED ⓘ Richard Karp NERFINISHED ⓘ the development of modern combinatorial optimization ⓘ Éva Tardos NERFINISHED ⓘ |
| knownFor |
Edmonds' algorithm for weighted matching
NERFINISHED
ⓘ
Edmonds' branching algorithm for optimum branchings NERFINISHED ⓘ Edmonds' matroid intersection algorithm NERFINISHED ⓘ Edmonds–Karp algorithm (with Richard Karp) NERFINISHED ⓘ blossom algorithm for maximum matching in general graphs ⓘ concept of polynomial-time algorithms in combinatorial optimization ⓘ efficient algorithms for graph matching ⓘ foundational work in combinatorial optimization ⓘ matroid intersection algorithms ⓘ paper "Matroids and the Greedy Algorithm" NERFINISHED ⓘ paper "Maximum Matching and a Polyhedron with 0,1-Vertices" NERFINISHED ⓘ paper "Paths, Trees, and Flowers" NERFINISHED ⓘ paper "Submodular Functions, Matroids, and Certain Polyhedra" NERFINISHED ⓘ polyhedral description of matching polytopes ⓘ polyhedral theory in combinatorial optimization ⓘ |
| languageOfWorkOrName | English ⓘ |
| notableIdea |
polyhedral approach to combinatorial optimization
ⓘ
polynomial-time solvability as a notion of efficient computation in optimization ⓘ use of submodular functions in optimization ⓘ |
| notableStudent | William R. Pulleyblank NERFINISHED ⓘ |
| workLocation | Waterloo, Ontario NERFINISHED ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Jack Edmonds Description of subject: Jack Edmonds is a pioneering Canadian mathematician and computer scientist renowned for his foundational work in combinatorial optimization and polyhedral theory, including the development of efficient algorithms for matching and matroid intersection.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.