Fast Gossiping by Short Messages
From MaRDI portal
Publication:4210076
DOI10.1137/S0097539795283619zbMath0960.94044MaRDI QIDQ4210076
Jean-Claude Bermond, Ugo Vaccaro, Luisa Gargano, Adele A. Rescigno
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
94C15: Applications of graph theory to circuits and networks
Related Items
GATHERING RADIO MESSAGES IN THE PATH, Concurrent multicast in weighted networks, A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem, On the hamiltonicity of the Cartesian product, Optimal gathering protocols on paths under interference constraints, Communication complexity of fault-tolerant information diffusion, On the communication complexity of polling, Optimal gossiping in paths and cycles, Optimal gossiping in square 2D meshes