Fast Information Spreading in Graphs with Large Weak Conductance

DOI10.1137/110845380zbMath1261.68091MaRDI QIDQ4910571

Keren Censor-Hillel, Hadas Shachnai

Publication date: 19 March 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110845380

zbMATH Keywords

distributed computing; randomized algorithms; information spreading; weak conductance

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68W15: Distributed algorithms

Related Items

Rumor spreading with bounded in-degree