Fast Gossiping by Short Messages

DOI10.1137/S0097539795283619zbMath0960.94044OpenAlexW1976039605MaRDI QIDQ4210076

Adele A. Rescigno, Jean-Claude Bermond, Ugo Vaccaro, Luisa Gargano

Publication date: 20 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539795283619

zbMATH Keywords

networksgraphsgossiping

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)

Related Items (16)

Bounded information dissemination in multi-channel wireless networks ⋮ The total acquisition number of random graphs ⋮ On the communication complexity of polling ⋮ Optimal gossiping in square 2D meshes ⋮ The total acquisition number of random geometric graphs ⋮ Multi-level dynamo and opinion spreading ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ Fast gossiping by short messages ⋮ GATHERING RADIO MESSAGES IN THE PATH ⋮ Concurrent multicast in weighted networks ⋮ The unit acquisition number of binomial random graphs ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Optimal gossiping in paths and cycles ⋮ On the hamiltonicity of the Cartesian product ⋮ Optimal gathering protocols on paths under interference constraints ⋮ An inclusion hierarchy of irreversible dynamos

This page was built for publication: Fast Gossiping by Short Messages