Exploration of Constantly Connected Dynamic Graphs Based on Cactuses

Abstract : 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 \cite{IW13}. 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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

Contributor : David Ilcinkas <>
Submitted on : Thursday, January 29, 2015 - 4:51:39 PM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM
Long-term archiving on : Wednesday, May 27, 2015 - 2:10:24 PM


Files produced by the author(s)




David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade. Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. 21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Jul 2014, Hida Takayama, Japan. pp.250--262, ⟨10.1007/978-3-319-09620-9_20⟩. ⟨hal-01068904⟩



Record views


Files downloads