The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1978 vol.27)
pp: 97-105
J.L. Bentley , Department of Computer Science, Carnegie-Mellon University
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 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.
INDEX TERMS
trees., Clustering, communication networks, graphs, minimal spanning trees, shortest connection networks
CITATION
J.L. Bentley, J.H. Friedman, "Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces", IEEE Transactions on Computers, vol.27, no. 2, pp. 97-105, February 1978, doi:10.1109/TC.1978.1675043
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool