On the worst case of a minimal spanning tree algorithm for euclidean space
- 1 March 1983
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 23 (1) , 1-8
- https://doi.org/10.1007/bf01937321
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Finding minimal spanning trees in a euclidean coordinate spaceBIT Numerical Mathematics, 1981
- Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate SpacesIEEE Transactions on Computers, 1978