Graph Decomposition for Memoryless Periodic Exploration

We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v , the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica 2012-06, Vol.63 (1-2), p.26-38
Hauptverfasser:	Kosowski, Adrian, Navarra, Alfredo
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Applied sciences Computer Science Computer science control theory systems Computer Systems Organization and Communication Networks Control theory. Systems Data Structures and Algorithms Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Robotics Theoretical computing Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!