Optimal Fault-Tolerant Dispersion on Oriented Grids
Optimal Fault-Tolerant Dispersion on Oriented Grids
Dispersion of mobile robots over the nodes of an anonymous graph is an important problem and turns out to be a crucial subroutine for designing efficient algorithms for many fundamental graph problems via mobile robots. In this problem, starting from an arbitrary initial distribution of $n$ robots across the $n$ …