2026-08-16T12:03:47Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19903 2024-05-31T08:33:44Z ddc:004 open_access

Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents Bramas, Quentin Masuzawa, Toshimitsu Tixeuil, Sébastien Mobile Agents Distributed Algorithms Energy sharing We consider the problem of graph exploration by energy sharing mobile agents that are subject to crash faults. More precisely, we consider a team of two agents where at most one of them may fail unpredictably, and the considered topology is that of acyclic graphs (i.e. trees). We consider both the asynchronous and the synchronous settings, and we provide necessary and sufficient conditions about the energy in two settings: line-shaped graphs, and general trees. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Quentin Bramas and Toshimitsu Masuzawa and Sébastien Tixeuil 2024 Is Part Of LIPIcs, Volume 292, 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAND.2024.25 urn:nbn:de:0030-drops-199031 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.25 eng https://creativecommons.org/licenses/by/4.0/legalcode