Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
Work
Year: 1978
Type: article
Abstract: 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 ... more
Source: IEEE Transactions on Computers
Institutions Carnegie Mellon University, Stanford Synchrotron Radiation Lightsource, SLAC National Accelerator Laboratory
Cites: 21
Cited by: 119
Related to: 10
FWCI: 6.272
Citation percentile (by year/subfield): 97.32
Subfield: Signal Processing
Field: Computer Science
Domain: Physical Sciences
Open Access status: green