Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs

Taichi Inoue, Naoki Kitamura, Taisuke Izumi +1

We investigated the computational power of a single mobile agent in an $n$-node graph with storage (i.e., node memory). Generally, a system with one-bit agent memory and $O(1)$-bit…