A probabilistic minimum spanning tree algorithm
- 31 January 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (1), 44-48
- https://doi.org/10.1016/0020-0190(78)90039-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Finding nearest neighboursInformation Processing Letters, 1976
- On the average behavior of set merging algorithms (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1976
- Divide-and-conquer in multidimensional spacePublished by Association for Computing Machinery (ACM) ,1976
- Priority queues with update and finding minimum spanning treesInformation Processing Letters, 1975
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Finding near neighbours in K-dimensional spaceInformation Processing Letters, 1975
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957