A new distributed algorithm to find breadth first search trees
- 1 May 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (3) , 315-322
- https://doi.org/10.1109/tit.1987.1057314
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A single source shortest path algorithm for a planar distributed networkPublished by Springer Nature ,2005
- Distributed BFS algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- An efficient network synchronization protocolPublished by Association for Computing Machinery (ACM) ,1984
- Distributed network protocolsIEEE Transactions on Information Theory, 1983
- Distributed Minimum Hop AlgorithmsPublished by Defense Technical Information Center (DTIC) ,1982
- The interface message processor for the ARPA computer networkPublished by Association for Computing Machinery (ACM) ,1970