Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network
- 1 September 1987
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 2 (3) , 139-148
- https://doi.org/10.1007/bf01782774
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Graph AlgorithmsPublished by Cambridge University Press (CUP) ,2011
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of ProcessorsSIAM Journal on Computing, 1987
- A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile NodesIEEE Transactions on Computers, 1983
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- Performance analysis of a shortest-delay protocolComputer Networks (1976), 1982
- Packet Switching in Radio Channels: New Conflict-Free Multiple Access SchemesIEEE Transactions on Communications, 1980
- Approximate Traveling Salesman AlgorithmsOperations Research, 1980
- Multiaccess Protocols in Packet Communication SystemsIEEE Transactions on Communications, 1980
- Some theoretical aspects of position-location problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- BRAM: The Broadcast Recognizing Access MethodIEEE Transactions on Communications, 1979