Vol. 9 (10) pp. 315-319 DOI: 10.21474/IJAR01/13550

EXPLORATION WITH RETURN OF HIGHLY DYNAMIC NETWORKS

  • Assistant Professor, Polytechnic School of Thies (EPT), Senegal, in the LTISI Laboratory.
18 Downloads 65 Views
Crossref

Download Full Paper (PDF)

Abstract

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.

Keywords

Article Analytics

How to Cite This Article

Ahmed Mouhamadou Wade (2021); EXPLORATION WITH RETURN OF HIGHLY DYNAMIC NETWORKS, Int. J. of Adv. Res., 9 (10), 315-319, ISSN 2320-5407. DOI: https://doi.org/10.21474/IJAR01/13550

Corresponding Author

Ahmed Mouhamadou WADE
Assistant Professor, Polytechnic School of Thies (EPT)
Senegal
Creative Commons Attribution 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.