Optimal algorithms for dissemination of information in some interconnection networks
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 337-346
- https://doi.org/10.1007/bfb0029627
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the number of rounds necessary to disseminate informationPublished by Association for Computing Machinery (ACM) ,1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Broadcast Networks of Bounded DegreeSIAM Journal on Discrete Mathematics, 1988
- Generalizations of broadcasting and gossipingNetworks, 1988
- Gossips and telegraphsJournal of the Franklin Institute, 1979
- New gossips and telephonesDiscrete Mathematics, 1975
- A Cure for the Telephone DiseaseCanadian Mathematical Bulletin, 1972
- Gossips and telephonesDiscrete Mathematics, 1972