论文信息 - Quick gossiping by telegraphs

Quick gossiping by telegraphs

Abstract We consider gossiping in the complete doubly directed graph, i.e. telegrams arranged in rounds are used to exchange information between n points, each having one initial item. It is proved that at least 1.44·log 2 n rounds are needed to inform everybody about those n distinct items of information.

Roger Labahn | Ingo Warnke

[1] David W. Krumme,et al. Gossiping in Minimal Time , 1992, SIAM J. Comput..

[2] R. Labahn,et al. Quick Gossiping by Multi-Telegraphs , 1990 .

[3] Roger Labahn. Information flows on hypergraphs , 1993, Discret. Math..

[4] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[5] Peter Winkler,et al. Fast Information Sharing in a Complete Network , 1993, Discret. Appl. Math..

[6] Shimon Even,et al. On the number of rounds necessary to disseminate information , 1989, SPAA '89.

[7] P. Slater,et al. Gossips and telegraphs , 1979 .