Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Switch Atlas

Pioneer

Joseph Kruskal

Also Known As Joseph Bernard Kruskal, Jr.
Theory of Computation

Joseph Kruskal was an American mathematician best known in computer science for Kruskals algorithm, published in 1956, a greedy method for finding the minimum spanning tree of a weighted graph by repeatedly adding the cheapest edge that does not create a cycle. The algorithm remains a standard tool for problems such as designing and pricing communication and transportation networks at minimum cost, and it is taught alongside Prims algorithm as one of the two classic solutions to the minimum spanning tree problem.

Facts
Birth Year
1928 1
Birth Date
1928-01-29 1
Death Year
2010 1
Death Date
2010-09-19 1
Nationality
American 1
Award
Fellow of the American Statistical Association 2
Joseph Kruskal
Filter Results1 entry

Kruskal's Algorithm

Joseph Kruskal
Connections

Invented By

Kruskal's Algorithm, Algorithms

Joseph Kruskal published the minimum spanning tree algorithm bearing his name in 1956.

In the Other Atlases
Sources
1. Wikipedia: Joseph Kruskal
Wikimedia Foundation
  • lead sentence, birth date clause
    Joseph Bernard Kruskal, Jr. (; January 29, 1928, September 19, 2010) was an American mathematician.
  • lead sentence, death date clause
    Joseph Bernard Kruskal, Jr. (; January 29, 1928, September 19, 2010) was an American mathematician.
  • lead sentence, nationality clause
    Joseph Bernard Kruskal, Jr. (; January 29, 1928, September 19, 2010) was an American mathematician.
View the Source
2. Wikidata: Joseph Kruskal
Wikidata Q983361, class allow-list match (w-wdresolver-0926)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.