Graph Decomposition for Improving Memoryless Periodic Exploration

DOI10.1007/978-3-642-03816-7_43zbMath1250.05088OpenAlexW1546426591MaRDI QIDQ3182950

Adrian Kosowski, Alfredo Navarra

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_43

zbMATH Keywords

graph labelinggraph decompositionlabeling schemeperiodic explorationmemoryless robot

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Artificial intelligence for robotics (68T40)

Related Items (4)

Graph decomposition for memoryless periodic exploration ⋮ More efficient periodic traversal in anonymous undirected graphs ⋮ Synchronous black hole search in directed graphs ⋮ Universal Systems of Oblivious Mobile Robots

Cites Work

• More efficient periodic traversal in anonymous undirected graphs
• Fast periodic graph exploration with constant memory
• Setting port numbers for fast graph exploration
• Impact of memory size on graph exploration capability
• Automaten in planaren Graphen
• Graph exploration by a finite automaton
• Undirected ST-connectivity in log-space
• Space Lower Bounds for Maze Threadability on Restricted Machines
• Automata and Labyrinths
• Memory Efficient Anonymous Graph Exploration
• Structural Information and Communication Complexity
• Automata, Languages and Programming

This page was built for publication: Graph Decomposition for Improving Memoryless Periodic Exploration