On the Complexity of Information Spreading in Dynamic Networks

DOI10.1137/1.9781611973105.52zbMath1421.68122OpenAlexW4229692018MaRDI QIDQ5741760

Emanuele Viola, Chinmoy Dutta, Gopal Pandurangan, Zhifeng Sun, Rajmohan Rajaraman

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (14)

Traveling salesman problems in temporal graphs ⋮ Some lower bounds in dynamic networks with oblivious adversaries ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Causality, influence, and computation in possibly disconnected synchronous dynamic networks ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Temporal network optimization subject to connectivity constraints ⋮ The communication complexity of addition ⋮ Smoothed analysis of dynamic networks ⋮ Exploration of dynamic cactuses with sub-logarithmic overhead ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^* ⋮ Distributed computation in dynamic networks via random walks ⋮ On the expressivity of time-varying graphs

This page was built for publication: On the Complexity of Information Spreading in Dynamic Networks