Near-linear Time Dispersion of Mobile Agents

Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2

Consider that there are $k\le n$ agents in a simple, connected, and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. The goal of the dispersion problem is to move these $k$…