A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- 1 February 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (1) , 302-316
- https://doi.org/10.1137/s0097539794261118
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A trade-off between information and communication in broadcast protocolsJournal of the ACM, 1990
- Time-optimal leader election in general networksJournal of Parallel and Distributed Computing, 1990
- Graph spannersJournal of Graph Theory, 1989
- Complexity of network synchronizationJournal of the ACM, 1985
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980