Advertisement
Published in:
2014 | OriginalPaper | Chapter
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
Authors : David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade
Published in: Structural Information and Communication Complexity
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely constantly connected dynamic graphs. This problem has already been studied in the case where the agent knows the dynamics of the graph and the underlying graph is a ring of
n
vertices [5]. In this paper, we consider the same problem and we suppose that the underlying graph is a cactus graph (a connected graph in which any two simple cycles have at most one vertex in common). We propose an algorithm that allows the agent to explore these dynamic graphs in at most
$2^{O(\sqrt{\log n})} n$
time units. We show that the lower bound of the algorithm is
$2^{\Omega(\sqrt{\log n})} n$
time units.