@inproceedings{f5e34935a7d34b3d8689b847b193c0d1,
title = "Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs",
abstract = "We study the exploration problem by mobile agents in Connectivity Time dynamic graphs. The Connectivity Time model was introduced by Michail et al. [JPDC 2014] and is arguably one of the weakest dynamic graph connectivity models. We prove that exploration is impossible in such graphs using (n−1)(n−2)/2 mobile agents starting from an arbitrary initial configuration, even when agents have full knowledge of system parameters, global communication, full visibility, and infinite memory. We then present an exploration algorithm that uses (n−1)(n−2)/2 + 1 agents equipped with global communication, 1-hop visibility and O(log n) memory.",
keywords = "Anonymous graphs, Deterministic algorithm, Dynamic graphs, Exploration, Mobile agents",
author = "Ashish Saxena and Kaushik Mondal",
note = "Publisher Copyright: {\textcopyright} 2025 Ashish Saxena and Kaushik Mondal.; 39th International Symposium on Distributed Computing, DISC 2025 ; Conference date: 27-10-2025 Through 31-10-2025",
year = "2025",
month = jan,
day = "1",
doi = "10.4230/LIPIcs.DISC.2025.41",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Kowalski, \{Dariusz R.\}",
booktitle = "39th International Symposium on Distributed Computing, DISC 2025",
address = "Germany",
}