Fast Information Spreading in Graphs with Large Weak Conductance

DOI10.1137/110845380zbMath1261.68091OpenAlexW2047708977MaRDI 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 computingrandomized algorithmsinformation spreadingweak conductance

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Related Items (1)

Rumor spreading with bounded in-degree

This page was built for publication: Fast Information Spreading in Graphs with Large Weak Conductance