Better bounds for perpetual gossiping

A.D. Scott
1997 Discrete Applied Mathematics  
In the perpetual gossiping problem, introduced by Lie&man and Richards, information may be generated at any time and at any vertex of a graph G; adjacent vertices can communicate by telephone calls. We define W,(G) to be the minimum w such that, placing at most k calls each time unit, we can ensure that every piece of information is known to every vertex with w time units of its generation. Improving upon results of Liestman and Richards, we give bounds on W,(G) for the cases when G is a path, cycle or hypercube. *
doi:10.1016/s0166-218x(96)00088-1 fatcat:uob7zmwel5h4bepixpvocemlu4