The Worst Case Behavior of Randomized Gossip

DOI10.1007/978-3-642-29952-0_34zbMath1354.68022OpenAlexW2159691688MaRDI QIDQ2898044

Pierre Fraigniaud, Hervé Baumann, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos

Publication date: 16 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29952-0_34

zbMATH Keywords

broadcastrumor spreadinggossiprandom phone-call model

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Randomized algorithms (68W20) Network protocols (68M12)

Related Items (2)

On linear-time data dissemination in dynamic rooted trees ⋮ Odd gossiping

This page was built for publication: The Worst Case Behavior of Randomized Gossip