Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
A Padalkin, C Scheideler - arXiv preprint arXiv:2402.12123, 2024 - arxiv.org
In this paper, we study the computation of shortest paths within the\emph {geometric
amoebot model}, a commonly used model for programmable matter. Shortest paths are …
amoebot model}, a commonly used model for programmable matter. Shortest paths are …