Fast Periodic Graph Exploration with Constant Memory

DOI10.1007/978-3-540-72951-8_4zbMATH Open1201.68147OpenAlexW4250966362MaRDI QIDQ5425957FDOQ5425957

Authors: Ralf Klasing, Russell Martin, Alfredo Navarra, Xiaohui Zhang, 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

Recommendations

• Fast periodic graph exploration with constant memory
• More efficient periodic traversal in anonymous undirected graphs
• Setting port numbers for fast graph exploration
• Setting Port Numbers for Fast Graph Exploration
• More efficient periodic traversal in anonymous undirected graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Artificial intelligence for robotics (68T40)

Cited In (11)

• Memory Efficient Anonymous Graph Exploration
• Time and space optimality of rotor-router graph exploration
• Setting Port Numbers for Fast Graph Exploration
• Fast periodic graph exploration with constant memory
• More efficient periodic traversal in anonymous undirected graphs
• More efficient periodic traversal in anonymous undirected graphs
• On the Power of Local Orientations
• Anonymous graph exploration without collision by mobile robots
• Graph decomposition for memoryless periodic exploration
• 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)