EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Polylogarithmic time algorithms for shortest path forests in programmable matter

Andreas Padalkin, Christian Scheideler

Distributed Computing · 2026-06 · 39 (2)

DOI: 10.1007/s00446-026-00505-2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Distributed Computing, online erschienen am 18.04.2026. Verfasst von Andreas Padalkin und 1 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Deutsche Forschungsgemeinschaft.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we study the computation of shortest paths within the geometric amoebot model , a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts. We consider the reconfigurable circuit extension of the model where the amoebot structure is able to interconnect amoebots by so-called circuits. These circuits permit the instantaneous transmission of simple signals between connected amoebots. We propose distributed algorithms for the shortest path forest problem where, given a set of k sources and a set of $$\ell $$ ℓ destinations, the amoebot structure has to compute a forest that connects each destination to its closest source on a shortest path. Our main results are two algorithms for hole-free structures. The first algorithm constructs a shortest path tree for a single source within $$O(\log \ell )$$ O ( log ℓ ) rounds, and the second algorithm a shortest path forest for an arbitrary number of sources within $$O(\log n \log ^2 k)$$ O ( log n log 2 k ) rounds. The former algorithm also provides an O (1) rounds solution for the single pair shortest path problem (SPSP) and an $$O(\log n)$$ O ( log n ) rounds solution for the single source shortest path problem (SSSP) since these problems are special cases of the considered problem. Then, we adapt the latter algorithm to an offset version of the problem. This allows us to solve the problem for amoebot structures with holes within $$O(h \log ^3 n)$$ O ( h log 3 n ) rounds w.h.p. where h denotes the number of holes.

Förderung

  • Deutsche Forschungsgemeinschaft

Zitieren

APA

Padalkin, A., & Scheideler, C. (2026). Polylogarithmic time algorithms for shortest path forests in programmable matter. Distributed Computing, 39(2). https://doi.org/10.1007/s00446-026-00505-2

Vancouver

Padalkin A, Scheideler C. Polylogarithmic time algorithms for shortest path forests in programmable matter. Distributed Computing. 2026;39(2). doi:10.1007/s00446-026-00505-2

BibTeX
@article{Padalkin2026,
  author = {Padalkin, Andreas and Scheideler, Christian},
  title = {Polylogarithmic time algorithms for shortest path forests in programmable matter},
  journal = {Distributed Computing},
  year = {2026},
  volume = {39},
  number = {2},
  doi = {10.1007/s00446-026-00505-2}
}
Kostenlos starten →