A fully distributed (minimal) spanning tree algorithm
- 20 August 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (2) , 55-62
- https://doi.org/10.1016/0020-0190(86)90043-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Termination detection for distributed computationsInformation Processing Letters, 1984
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- A parallel algorithm for constructing minimum spanning treesJournal of Algorithms, 1980
- Distributed TerminationACM Transactions on Programming Languages and Systems, 1980
- Reverse path forwarding of broadcast packetsCommunications of the ACM, 1978