M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Matthew A Grayson
Journal of Complexity