1 citations · 2 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
Ali Pourmiri, Bernard Mans
The asynchronous rumor algorithm spreading propagates a piece of information, the so-called rumor, in a network. Starting with a single informed node, each node is associated with…
cs.DS2009
Exploration of Periodically Varying Graphs
Paola Flocchini, Bernard Mans, Nicola Santoro
We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unkn…