On the Power of Local Orientations

DOI10.1007/978-3-540-69355-0_14zbMath1143.68508OpenAlexW1522307347MaRDI QIDQ3511395

Monika Steinová

Publication date: 10 July 2008

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-69355-0_14

zbMATH Keywords

mobile computinglocal orientationright-hand rule

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Exploration of Time-Varying Connected Graphs with Silent Agents ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?

Cites Work

• Optimal graph exploration without good maps
• Piecemeal graph exploration by a mobile robot.
• Graph exploration by a finite automaton
• Setting Port Numbers for Fast Graph Exploration
• Automata and Labyrinths
• Impact of topographic information on graph exploration efficiency
• Exploring an unknown graph
• STACS 2004
• Fast Periodic Graph Exploration with Constant Memory
• Structural Information and Communication Complexity
• Structural Information and Communication Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Power of Local Orientations