1 paper
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…