Zero-Memory Graph Exploration with Unknown Inports

We study a very restrictive graph exploration problem. In our model, an agent without persistent memory is placed on a vertex of a graph and only sees the adjacent vertices. The goal is to visit every vertex of the graph, return to the start vertex, and terminate. The agent does not know through whi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Böckenhauer, Hans-Joachim, Frei, Fabian, Unger, Walter, Wehner, David
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!