More Efficient Periodic Traversal in Anonymous Undirected Graphs

DOI10.1007/978-3-642-11476-2_14zbMath1274.68270MaRDI QIDQ3408168

Jurek Czyzowicz, Wing-Kin Sung, Russell Martin, Jesper Jansson, David Ilcinkas, Ralf Klasing, Stefan Dobrev, Leszek Gąsieniec, Kunihiko Sadakane, Ioannis Lignos

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_14

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Graph decomposition for memoryless periodic exploration

Cites Work

• Unnamed Item
• Fast periodic graph exploration with constant memory
• Setting port numbers for fast graph exploration
• Automaten in planaren Graphen
• Piecemeal graph exploration by a mobile robot.
• The power of a pebble: Exploring and mapping directed graphs
• Graph exploration by a finite automaton
• Optimal constrained graph exploration
• Space Lower Bounds for Maze Threadability on Restricted Machines
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Automata and Labyrinths
• Exploring Unknown Undirected Graphs
• Exploring Unknown Environments
• Algorithms – ESA 2005
• Structural Information and Communication Complexity
• Structural Information and Communication Complexity
• Automata, Languages and Programming