A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading

DOI10.1016/j.endm.2009.07.055zbMath1273.05199OpenAlexW1974462695MaRDI QIDQ2851485

Benjamin Doerr, Mahmoud Fouz

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.055

zbMATH Keywords

gossipingdesign and analysis of algorithmsrandomness in computation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Deterministic network models in operations research (90B10) Network protocols (68M12) Communication theory (94A05)

Related Items (1)

An evolutionary game for the diffusion of rumor in complex networks

Cites Work

• Unnamed Item
• The shortest-path problem for graphs with random arc-lengths
• On the power of two-point based sampling
• Realistic analysis of some randomized algorithms
• Randomized algorithms and pseudorandom numbers
• A Time-Randomness Trade-Off for Oblivious Routing
• On Spreading a Rumor

This page was built for publication: A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading