Kruskal
E387063
coordinate system
family name
graph algorithm
human
mathematician
nonparametric statistical test
physicist
stability criterion
statistician
surname
Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Kruskal canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T3771928 — 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: Kruskal Context triple: [Martin David Kruskal, familyName, Kruskal]
-
A.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
B.
union–find data structure
The union–find data structure is an efficient algorithmic structure that maintains disjoint sets and supports fast union and find operations, widely used in graph algorithms such as Kruskal’s minimum spanning tree.
-
C.
Eppstein
Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
-
D.
Fibonacci heap
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
-
E.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
- 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: Kruskal Target entity description: Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
-
A.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
B.
union–find data structure
The union–find data structure is an efficient algorithmic structure that maintains disjoint sets and supports fast union and find operations, widely used in graph algorithms such as Kruskal’s minimum spanning tree.
-
C.
Eppstein
Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
-
D.
Fibonacci heap
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
-
E.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
- F. None of above. chosen
Statements (42)
| Predicate | Object |
|---|---|
| instanceOf |
coordinate system
ⓘ
family name ⓘ graph algorithm ⓘ human ⓘ human ⓘ human ⓘ mathematician ⓘ mathematician ⓘ nonparametric statistical test ⓘ physicist ⓘ stability criterion ⓘ statistician ⓘ surname ⓘ |
| countryOfCitizenship | United States of America ⓘ |
| employer |
Princeton University
ⓘ
Rutgers University ⓘ |
| fieldOfWork |
combinatorics
ⓘ
computer science ⓘ general relativity ⓘ graph theory ⓘ mathematics ⓘ nonlinear science ⓘ physics ⓘ plasma physics ⓘ soliton theory ⓘ statistics ⓘ |
| knownFor |
Korteweg–De Vries equation analysis
ⓘ
Kruskal’s minimum spanning tree algorithm ⓘ
surface form:
Kruskal's algorithm
Kruskal's tree theorem ⓘ Kruskal–Shafranov instability criterion ⓘ
surface form:
Kruskal–Shafranov limit
Kruskal–Szekeres coordinates ⓘ Kruskal–Wallis test ⓘ inverse scattering transform ⓘ work on solitons ⓘ |
| languageOfOrigin | German ⓘ |
| notableBearer |
Joseph B. Kruskal
ⓘ
Martin David Kruskal ⓘ William Kruskal ⓘ
surface form:
William H. Kruskal
|
| sibling |
Joseph B. Kruskal
ⓘ
William Kruskal ⓘ
surface form:
William H. Kruskal
|
| use |
magnetically confined plasma stability
ⓘ
minimum spanning tree ⓘ |
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: Kruskal Description of subject: Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
John B. Kruskal