On the complexity of information spreading in dynamic networks

SODA, pp.717-736, (2013)

Cited by: 71|Views17
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 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 and capabilitie...More

Code:

Data:

ZH
Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments