Approximation Algorithms for Broadcasting and Gossiping
- 1 May 1997
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 43 (1) , 47-55
- https://doi.org/10.1006/jpdc.1997.1318
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Effective systolic algorithms for gossiping in cycles and two-dimensional gridsPublished by Springer Nature ,1995
- Methods and problems of communication in usual networksDiscrete Applied Mathematics, 1994
- Network communication in edge-colored graphs: gossipingIEEE Transactions on Parallel and Distributed Systems, 1993
- Gossiping in Minimal TimeSIAM Journal on Computing, 1992
- Approximation algorithms for minimum time broadcastPublished by Springer Nature ,1992
- Randomized broadcast in networksPublished by Springer Nature ,1990
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- A simple proof of Menger's theoremJournal of Graph Theory, 1984
- On two minimax theorems in graphJournal of Combinatorial Theory, Series B, 1976
- New gossips and telephonesDiscrete Mathematics, 1975