A parallel algorithm for constructing minimum spanning trees
- 31 March 1980
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 1 (1) , 51-59
- https://doi.org/10.1016/0196-6774(80)90004-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Algorithm 422: minimal spanning tree [H]Communications of the ACM, 1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957