On the Optimality of General Lower Bounds for Broadcasting and Gossiping

DOI10.1137/S0895480199365397zbMath0968.68003MaRDI QIDQ2719169

Stéphane Pérennes, Michele Flammini

Publication date: 21 June 2001

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

zbMATH Keywords

gossipingbroadcastingsystolicbounded-degreeoptimal probabilistic constructions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Messy broadcasting - decentralized broadcast schemes with limited knowledge ⋮ Move-optimal gossiping among mobile agents ⋮ Lower bounds on systolic gossip

This page was built for publication: On the Optimality of General Lower Bounds for Broadcasting and Gossiping