Time and Cost Trade-Offs in Gossiping

DOI10.1137/S0895480295292934zbMath0929.05077OpenAlexW1982053690MaRDI QIDQ4210214

Andrzej Pelc, Leszek Gąsieniec, Artur Czumaj

Publication date: 21 September 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

calling schemegossiping algorithmgossiping scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Time-Efficient Broadcast in Radio Networks ⋮ Optimal gossiping in paths and cycles

This page was built for publication: Time and Cost Trade-Offs in Gossiping