Zero-memory graph exploration with unknown inports

DOI10.1007/978-3-031-32733-9_11arXiv2301.13860MaRDI QIDQ6148067

Hans-Joachim Böckenhauer, Walter Unger, David Wehner, Fabian Frei

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.13860

zbMATH Keywords

mobile agentsgraph explorationzero memory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Time and space optimality of rotor-router graph exploration
• Graph Theory
• Label-guided graph exploration by a finite automaton
• Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
• Memory Efficient Anonymous Graph Exploration

This page was built for publication: Zero-memory graph exploration with unknown inports