Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
Data up to Jan 2025
Total Citations Per Year
Abstract
References (21)
A note on two problems in connexion with graphs
1959 • 22,492 citations
The Art of Computer Programming
1968 • 16,727 citations
On the shortest spanning subtree of a graph and the traveling salesman problem
1956 • 4,806 citations
Hierarchical clustering schemes
1967 • 4,697 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
An Algorithm for Finding Best Matches in Logarithmic Expected Time
1977 • 2,694 citations
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
1971 • 1,764 citations
Minimum Spanning Trees and Single Linkage Cluster Analysis
1969 • 1,212 citations
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
1956 • 1,101 citations
The Art of Computer Programming, Vol. 3: Sorting and Searching
1974 • 932 citations
Algorithm 232 : HEAPSORT
1964 • 495 citations
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
1975 • 157 citations
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
1977 • 146 citations
A short introduction to the art of programming
1977 • 124 citations
Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
1957 • 68 citations
Algorithm 422: minimal spanning tree [H]
1972 • 59 citations
A hardware wrapper for the SHA-3 hash algorithms
2010 • 54 citations
Computers and pattern recognition
1967 • 47 citations
An Algorithm for Noisy Template Matching.
1974 • 30 citations
A Note on Minimal Reed-Muller Canonical Forms of Switching Functions
1977 • 14 citations
Computational Geometry
2013 • 4 citations