On the complexity of some arborescences finding problems on a multihop radio network
- 1 June 1989
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 29 (2) , 212-216
- https://doi.org/10.1007/bf01952676
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- A note on finding optimum branchingsNetworks, 1979
- Finding optimum branchingsNetworks, 1977