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
Connections
Invented By
Joseph Kruskal published the minimum spanning tree algorithm bearing his name in 1956.
In the Other Atlases
Sources
1. Wikipedia: Joseph Kruskal
Wikimedia Foundationlead 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 Joseph Kruskal (Wikidata)
Wikidata alias: Joseph Bernard Kruskal, Jr.
Joseph Bernard Kruskal, Jr.
Wikidata P166: Fellow of the American Statistical Association
Wikidata P166 (award received): Fellow of the American Statistical Association.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.