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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1044; S. 115272
1. Verfasser:	Kshemkalyani, Ajay D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.08.2025
Schlagworte:	Dispersion Distributed algorithm Graph algorithm Graph exploration Mobile robot Mobile robot Graph exploration Dispersion Graph algorithm Distributed algorithm
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!