Tight Bounds for Rumor Spreading with Vertex Expansion
Tight Bounds for Rumor Spreading with Vertex Expansion
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)Tight Bounds for Rumor Spreading with Vertex ExpansionGeorge GiakkoupisGeorge Giakkoupispp.801 - 815Chapter DOI:https://doi.org/10.1137/1.9781611973402.59PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract We establish a bound for the classic PUSH-PULL rumor spreading protocol on general graphs, in …