Randomized Rumor Spreading in Dynamic Graphs
From MaRDI portal
Publication:5167863
DOI10.1007/978-3-662-43951-7_42zbMath1409.68214OpenAlexW121555478MaRDI QIDQ5167863
George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01097142/file/icalp14_dynamic.pdf
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Related Items
Deleting edges to restrict the size of an epidemic in temporal networks, Random Walks on Randomly Evolving Graphs, Computing maximum matchings in temporal graphs, The contact process with dynamic edges on \(\mathbb{Z}\), On linear-time data dissemination in dynamic rooted trees, Temporal Vertex Cover with a Sliding Time Window, Temporal vertex cover with a sliding time window, Unnamed Item, Unnamed Item, Sliding window temporal graph coloring, The temporal explorer who returns to the base, Discovery Through Gossip, Linking the mixing times of random walks on static and dynamic random graphs