Open AccessEXPLORATION WITH RETURN OF HIGHLY DYNAMIC NETWORKS
Author(s) -
Ahmed Mouhamadou Wade
Publication year - 2021
Publication title -
international journal of advanced research
Language(s) - English
Resource type - Journals
ISSN - 2320-5407
DOI - 10.21474/ijar01/13550
Subject(s) - computer science , graph , vertex (graph theory) , dynamic network analysis , theoretical computer science , computer network
In this paper, we study the necessary and sufficient time to explore with return constantly connected dynamic networks modelled by a dynamic graphs. Exploration with return consists, for an agent operating in a dynamic graph, of visiting all the vertices of the graph and returning to the starting vertex. We show that for constantly connected dynamic graphs based on a ring of sizen,3n-4 time units are necessary and sufficient to explore it. Assuming that the agent knows the dynamics of the graph.