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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1044; p. 115272
Main Author:	Kshemkalyani, Ajay D.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2025
Subjects:	Dispersion Distributed algorithm Graph algorithm Graph exploration Mobile robot Mobile robot Graph exploration Dispersion Graph algorithm Distributed algorithm
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!