# Global Information Sharing under Network Dynamics

CoRR, 2014.

Cited by: 2|Views8
EI

Abstract:

We study how to spread $k$ tokens of information to every node on an $n$-node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be completed in $O(n + k)$ rounds in any static network, and determining its complexity in dynamic networks is central to understanding the algorithmic limits a...More

Code:

Data:

Full Text
Bibtex