A probabilistic minimum spanning tree algorithm
Data up to Jan 2025
Total Citations Per Year
Abstract
References (17)
A note on two problems in connexion with graphs
1959 • 22,492 citations
Clustering Algorithms
1975 • 6,014 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
Sorting and Searching
1973 • 1,580 citations
Clustering Algorithms.
1976 • 1,518 citations
Closest-point problems
1975 • 1,071 citations
Preserving order in a forest in less than logarithmic time and linear space
1977 • 432 citations
Programming, Games and Transportation Networks.
1967 • 237 citations
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
1975 • 157 citations
Divide-and-conquer in multidimensional space
1976 • 150 citations
Algorithms and Complexity
2021 • 144 citations
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
1978 • 119 citations
Priority queues with update and finding minimum spanning trees
1975 • 88 citations
Algorithm 422: minimal spanning tree [H]
1972 • 59 citations
Finding nearest neighbours
1976 • 34 citations
Finding near neighbours in K-dimensional space
1975 • 26 citations
On the average behavior of set merging algorithms (Extended Abstract)
1976 • 26 citations