Showing cs.DCShow all
2 papers · 1 filter
cs.DC2025
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
Shota Takahashi, Haruki Kanaya, Shoma Hiraoka +2
Recently, Böckenhauer, Frei, Unger, and Wehner (SIROCCO 2023) introduced a novel variant of the graph exploration problem in which a single memoryless agent must visit all nodes o…
cs.DC2025
Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
Jion Hirose, Ryota Eguchi, Yuichi Sudo
We study the \emph{Byzantine} gathering problem involving mobile agents with unique identifiers (IDs), of which are Byzantine. These agents start the execution of a common…