Asynchronous Rumor Spreading in Preferential Attachment Graphs
From MaRDI portal
Publication:2904566
DOI10.1007/978-3-642-31155-0_27zbMath1357.68012OpenAlexW2159732236MaRDI QIDQ2904566
Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
Publication date: 14 August 2012
Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.1969
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)
Related Items (8)
Stochastic analysis of rumor spreading with multiple pull operations ⋮ Asynchronous rumor spreading on random graphs ⋮ On the Push&Pull Protocol for Rumor Spreading ⋮ Continuous-time stochastic analysis of rumor spreading with multiple operations ⋮ Rumor Spreading with No Dependence on Conductance ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Faster rumor spreading with multiple calls ⋮ Randomized rumor spreading in poorly connected small-world networks
This page was built for publication: Asynchronous Rumor Spreading in Preferential Attachment Graphs
