Sciweavers

84
Voted
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
14 years 10 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer