Finding minimal spanning trees in a euclidean coordinate space
Authors:
- 1 March 1981
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 21 (1) , 46-54
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate SpacesIEEE Transactions on Computers, 1978
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Divide-and-conquer in multidimensional space1976
- Priority queues with update and finding minimum spanning treesInformation Processing Letters, 1975
- Closest-point problems1975
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956