Note on optimal gossiping in some weak-connected graphs
- 1 May 1994
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 127 (2) , 395-402
- https://doi.org/10.1016/0304-3975(94)90049-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimal algorithms for dissemination of information in some interconnection networksAlgorithmica, 1993
- Fast Gossiping for the HypercubeSIAM Journal on Computing, 1992
- 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
- Broadcast Networks of Bounded DegreeSIAM Journal on Discrete Mathematics, 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