Sparse networks supporting efficient reliable broadcasting
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 388-397
- https://doi.org/10.1007/3-540-56939-1_88
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal broadcasting in faulty hypercubesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Almost Safe Gossiping in Bounded Degree NetworksSIAM Journal on Discrete Mathematics, 1992
- Tighter time bounds on fault‐tolerant broadcasting and gossipingNetworks, 1992
- Gossiping in Minimal TimeSIAM Journal on Computing, 1992
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Broadcasting with random faultsDiscrete Applied Mathematics, 1988
- On Gossiping with Faulty Telephone LinesSIAM Journal on Algebraic Discrete Methods, 1987
- Telephone Problems with FailuresSIAM Journal on Algebraic Discrete Methods, 1986
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979