Fast Gossiping by Short Messages
暂无分享,去创建一个
Jean-Claude Bermond | Luisa Gargano | Adele A. Rescigno | Ugo Vaccaro | J. Bermond | L. Gargano | U. Vaccaro | A. A. Rescigno
[1] Brian Alspach. The classification of hamiltonian generalized Petersen graphs , 1983, J. Comb. Theory, Ser. B.
[2] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[3] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[4] David W. Krumme,et al. Gossiping in Minimal Time , 1992, SIAM J. Comput..
[5] S. Louis Hakimi,et al. Sequential information dissemination by packets , 1992, Networks.
[6] Martin Fürer,et al. Approximating the minimum degree spanning tree to within one from the optimal degree , 1992, SODA '92.
[7] Noga Alon,et al. Routing permutations on graphs via matchings , 1993, SIAM J. Discret. Math..
[8] Pierre Fraigniaud,et al. Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..
[9] Krzysztof Diks,et al. Fast gossiping with short unreliable messages , 1994, Discret. Appl. Math..
[10] Edward F. Schmeichel,et al. Parallel Information Dissemination by Packets , 1994, SIAM J. Comput..
[11] Dominique Sotteau,et al. Communications in Bus Networks , 1994, Canada-France Conference on Parallel and Distributed Computing.