43 citations · 115 across the 27 of their papers we have counts for
4 papers · 1 filter
Information Spreading in Dynamic Graphs
Andrea Clementi, Riccardo Silvestri, Luca Trevisan
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a rando…
Flooding Time in Opportunistic Networks under Power Law and Exponential Inter-Contact Times
Luca Becchetti, Andrea Clementi, Francesco Pasquale +3
Performance bounds for opportunistic networks have been derived in a number of recent papers for several key quantities, such as the expected delivery time of a unicast message, or…
Information Spreading in Stationary Markovian Evolving Graphs
Andrea Clementi, Angelo Monti, Francesco Pasquale +1
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely genera…
Parsimonious Flooding in Geometric Random-Walks
Andrea Clementi, Riccardo Silvestri
We study the information spreading yielded by the \emph{(Parsimonious) -Flooding Protocol} in geometric Mobile Ad-Hoc Networks. We consider agents on a convex plane region o…