Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
From MaRDI portal
Publication:4146251
DOI10.1109/TC.1978.1675043zbMath0369.68027OpenAlexW2018359542MaRDI QIDQ4146251
Jerome H. Friedman, Jon Louis Bentley
Publication date: 1978
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1978.1675043
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Related Items
An O(N log N) minimal spanning tree algorithm for N points in the plane, The central limit theorem for Euclidean minimal spanning trees. I, Finding minimal spanning trees in a Euclidean coordinate space, The random minimal spanning tree in high dimensions, Resistant estimation of multivariate location using minimum spanning trees, Compact storage schemes for formatted files by spanning trees, Parameter estimation from a model grid application to the Gaia RVS spectra, Dual‐tree fast exact max‐kernel search, On the worst case of a minimal spanning tree algorithm for euclidean space, Expected-time complexity results for hierarchic clustering algorithms which use cluster centres
