Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge

Tanvir Kaur, Barun Gorain, Kaushik Mondal

Distance-2-Dispersion (D-2-D) problem aims to disperse $k$ mobile agents starting from an arbitrary initial configuration on an anonymous port-labeled graph $G$ with $n$ nodes such…