Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting

DOI10.1016/j.endm.2009.07.092zbMath1273.05204OpenAlexW1972007456MaRDI QIDQ2851516

Anna Huber, Nikolaos Fountoulakis

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.092

zbMATH Keywords

gossipingderandomizationcomplete graphrumour spreadingrandomized broadcastingquasirandom broadcastingquasirandom protocolfully randomized protocol

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Network protocols (68M12) Communication theory (94A05)

Related Items (1)

Deterministic Random Walks for Rapidly Mixing Chains

Cites Work

• Unnamed Item
• The shortest-path problem for graphs with random arc-lengths
• Tight bounds for quasirandom rumor spreading
• Randomized broadcast in networks
• Chip-Firing and Rotor-Routing on Directed Graphs
• On Spreading a Rumor

This page was built for publication: Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting