Kruskal's algorithm
0 sources
Kruskal's algorithm
Summary
Kruskal's algorithm is a greedy algorithm[1]. It draws 369 Wikipedia views per month (greedy_algorithm category, ranking #1 of 1).[2]
Key Facts
- Kruskal's algorithm is credited with the discovery of Joseph Kruskal[3].
- Kruskal's algorithm's image is recorded as MST kruskal en.gif[4].
- Kruskal's algorithm's instance of is recorded as greedy algorithm[5].
- Kruskal's algorithm's instance of is recorded as graph algorithm[6].
- Joseph Kruskal is named after Kruskal's algorithm[7].
- Kruskal's algorithm's Commons category is recorded as Kruskal's algorithm[8].
- Kruskal's algorithm's publication date is recorded as +1956-00-00T00:00:00Z[9].
- Kruskal's algorithm's Freebase ID is recorded as /m/0f2gx[10].
- Kruskal's algorithm's Stack Exchange tag is recorded as https://stackoverflow.com/tags/kruskals-algorithm[11].
- Kruskal's algorithm's computes solution to is recorded as minimum spanning tree[12].
- Kruskal's algorithm's uses is recorded as disjoint-set data structure[13].
- Kruskal's algorithm's worst-case time complexity is recorded as O(E \log V)[14].
- Kruskal's algorithm's Dictionary of Algorithms and Data Structures ID is recorded as kruskalsalgo[15].
- Kruskal's algorithm's Microsoft Academic ID is recorded as 63645285[16].
- Kruskal's algorithm's OpenAlex ID is recorded as C63645285[17].
Body
Designation and Status
Recorded instance of include greedy algorithm[5] and graph algorithm[6].
History and Context
Joseph Kruskal is named after Kruskal's algorithm[7].
Why It Matters
Kruskal's algorithm draws 369 Wikipedia views per month (greedy_algorithm category, ranking #1 of 1).[2] It has Wikipedia articles in 22 language editions, a strong signal of global cultural recognition.[18] It is known by 14 alternative names across languages and contexts.[19]