82 search results - page 1 / 17 » Information dissemination in highly dynamic graphs |
DIALM
2005
ACM
13 years 6 months ago
2005
ACM
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...
ASUNAM
2011
IEEE
12 years 4 months ago
2011
IEEE
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
ALGORITHMICA
2011
12 years 11 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
GC
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
WMCSA
2002
IEEE
13 years 9 months ago
2002
IEEE
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...