Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
- 1 May 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 5 (2) , 178-198
- https://doi.org/10.1137/0405015
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Sparse broadcast graphsDiscrete Applied Mathematics, 1992
- Tight Bounds on Mimimum Broadcast NetworksSIAM Journal on Discrete Mathematics, 1991
- Time bounds on fault‐tolerant broadcastingNetworks, 1989
- On the construction of minimal broadcast networksNetworks, 1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- On Gossiping with Faulty Telephone LinesSIAM Journal on Algebraic Discrete Methods, 1987
- Telephone Problems with FailuresSIAM Journal on Algebraic Discrete Methods, 1986
- Fault-tolerant broadcast graphsNetworks, 1985
- Minimal broadcast networksNetworks, 1979
- Minimum broadcast graphsDiscrete Mathematics, 1979