Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
Journal of the ACM (JACM)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Algorithm 422: minimal spanning tree [H]
Communications of the ACM
Computational geometry.
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
IEEE Transactions on Computers
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph based k-means clustering
Signal Processing
kNN-Borůvka-GPU: a fast and scalable MST construction from kNN graphs on GPU
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 14.98 |
Algorithms are presented that construct the shortest connecting network, or minimal spanning tree (MST), of N points embedded in k-dimensional coordinate space. These algorithms take advantage of the geometry of such spaces to substantially reduce the computation from that required to construct MST's of more general graphs. An algorithm is also presented that constructs a spanning tree that is very nearly minimal with computation proportional to N log N for all k.