Network communication in edge-colored graphs: gossiping
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (4), 438-445
- https://doi.org/10.1109/71.219758
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Optimal algorithms for dissemination of information in some interconnection networksPublished by Springer Nature ,2005
- Gossiping in Minimal TimeSIAM Journal on Computing, 1992
- Parallel algorithms for gossiping by mailInformation Processing Letters, 1990
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- The number of rounds needed to exchange information within a graphDiscrete Applied Mathematics, 1983
- New gossips and telephonesDiscrete Mathematics, 1975