Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading

DOI10.1137/09075768XzbMath1207.60004MaRDI QIDQ3058539

Nikolaos Fountoulakis, Anna Huber

Publication date: 3 December 2010

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

zbMATH Keywords

derandomizationrandomized broadcastingquasirandom broadcasting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial probability (60C05)

Related Items (5)

Rumor Spreading with No Dependence on Conductance ⋮ Direction-reversing quasi-random rumor spreading with restarts ⋮ Asymptotically Optimal Randomized Rumor Spreading ⋮ Two different approaches for parameter identification in a spatial-temporal rumor propagation model based on Turing patterns ⋮ Deterministic random walks on finite graphs

This page was built for publication: Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading