Dispersion of mobile robots on graphs in the asynchronous model

The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k≤n, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to g...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1044; s. 115272
Hlavný autor:	Kshemkalyani, Ajay D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.08.2025
Predmet:	Dispersion Distributed algorithm Graph algorithm Graph exploration Mobile robot Mobile robot Graph exploration Dispersion Graph algorithm Distributed algorithm
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!