Communication complexity of quasirandom rumor spreading

DOI10.1007/978-3-642-15775-2_12MaRDI QIDQ3586457zbMATH OpenOpenAlexFDO

Authors Petra Berenbrink, Robert Elsässer, Thomas Sauerwald

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://www.repository.cam.ac.uk/handle/1810/294035

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Communication complexity of quasirandom rumor spreading
• Quasirandom rumor spreading
• Quasirandom Rumor Spreading: An Experimental Analysis
• Quasirandom rumor spreading, an experimental analysis
• Tight bounds for quasirandom rumor spreading

Cited in

(5)

• Dynamical behavior of a rumor transmission model with psychological effect in emergency event
• Communication complexity of quasirandom rumor spreading
• Randomised broadcasting: memory vs. randomness
• scientific article; zbMATH DE number 7532 (Why is no real title available?)
• Analyzing the dynamics of a rumor transmission model with incubation

This page was built for publication: Communication complexity of quasirandom rumor spreading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586457)