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...
—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...
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...
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques...
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...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...
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...