Fast Periodic Graph Exploration with Constant Memory
DOI10.1007/978-3-540-72951-8_4zbMATH Open1201.68147OpenAlexW4250966362MaRDI QIDQ5425957FDOQ5425957
Leszek Gąsieniec, Alfredo Navarra, Russell Martin, Xiaohui Zhang, Ralf Klasing
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
Recommendations
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Artificial intelligence for robotics (68T40)
Cited In (8)
- Memory Efficient Anonymous Graph Exploration
- Setting Port Numbers for Fast Graph Exploration
- Fast periodic graph exploration with constant memory
- More efficient periodic traversal in anonymous undirected graphs
- On the Power of Local Orientations
- Anonymous graph exploration without collision by mobile robots
- Structural Information and Communication Complexity
- Graph Decomposition for Improving Memoryless Periodic Exploration
This page was built for publication: Fast Periodic Graph Exploration with Constant Memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425957)