A Distributed Algorithm for Minimum-Weight Spanning Trees
- 1 January 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 5 (1) , 66-77
- https://doi.org/10.1145/357195.357200
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 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