On the worst case of a minimal spanning tree algorithm for euclidean space
From MaRDI portal
Publication:1836479
DOI10.1007/BF01937321zbMath0505.68029MaRDI QIDQ1836479
Publication date: 1983
Published in: BIT (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
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
Cites Work