Fast Periodic Graph Exploration with Constant Memory
From MaRDI portal
Publication:5425957
DOI10.1007/978-3-540-72951-8_4zbMath1201.68147OpenAlexW4250966362MaRDI QIDQ5425957
Alfredo Navarra, Russell Martin, Xiaohui Zhang, Ralf Klasing, Leszek Gąsieniec
Publication date: 15 November 2007
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72951-8_4
Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items (3)
On the Power of Local Orientations ⋮ Fast periodic graph exploration with constant memory ⋮ Anonymous graph exploration without collision by mobile robots
This page was built for publication: Fast Periodic Graph Exploration with Constant Memory