Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies

DOI10.1007/978-3-030-24922-9_12OpenAlexW2962052248MaRDI QIDQ2303287

Alfredo Navarra, Gabriele Di Stefano, Serafino Cicerone

Publication date: 3 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24922-9_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

Related Items (6)

Gathering over Meeting Nodes in Infinite Grid* ⋮ Molecular robots with chirality on grids ⋮ Time optimal gathering of myopic robots on an infinite triangular grid ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Wait-free approximate agreement on graphs ⋮ Wait-free approximate agreement on graphs

This page was built for publication: Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies