Flooding in dynamic graphs with arbitrary degree sequence
We study the flooding time in dynamic random graphs with arbitrary degree sequence. In the case of power-law degree sequences, the flooding time is almost surely log(n) log ( n ) . In the general case, upper bounds depend on specific properties of the sequence.
dynamic graphs flooding protocol power-law graphs distributed computing