3 papers
cs.DS2025
On Computing Top- Simple Shortest Paths from a Single Source
Mattia D'Emidio, Gabriele Di Stefano
We investigate the problem of computing the top- simple shortest paths in weighted digraphs. While the single-pair variant -- finding the top- simple shortest paths between t…
cs.DC2025
Gathering in Non-Vertex-Transitive Graphs Under Round Robin
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The Gathering problem for a swarm of robots asks for a distributed algorithm that brings such entities to a common place, not known in advance. We consider the well-known OBLOT mod…
cs.DC2025
On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The OBLOT model has been extensively studied in theoretical swarm robotics. It assumes weak capabilities for the involved mobile robots, such as they are anonymous, disoriented, no…