1. Bermond, J.-C., P. Fraigniaud, ‘Broadcasting and Gossiping in de Bruijn Networks,’ SIAM Journal on Computing, 23(1), pp. 212–225, 1994.
2. Lect Notes Comput Sci;O. Delmas,1996
3. Fertin, G., ‘Trade-Offs for Odd Gossiping,’ Proc. 6th Colloquium on Structural Information ℰ Communication Complexity, Proceedings in Informatics 5, pp. 137–151, Carleton Scientific, 1999.
4. Fraigniaud, P., J.G. Peters, ‘Minimum Linear Gossip Graphs and Maximal Linear (Δ k)-Gossip Graphs,’ Techn. Rep. CMPT TR 94-06, Simon Fraser University, Burnaby, B.C., 1994. Available at http://www.fas.sfu.ca/pub/cs/techreports/1994/ .
5. Fraigniaud, P., S. Vial, ‘Approximation Algorithms for Broadcasting and Gossiping,’ Journal of Parallel and Distributed Computing, 43(1), pp. 47–55, 1997.