More Efficient Periodic Traversal in Anonymous Undirected Graphs

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

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

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

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

Related Items (1)

Graph decomposition for memoryless periodic exploration

Cites Work

• 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 an unknown graph
• Exploring Unknown Undirected Graphs
• Exploring Unknown Environments
• Algorithms – ESA 2005
• Structural Information and Communication Complexity
• Structural Information and Communication Complexity
• Automata, Languages and Programming

This page was built for publication: More Efficient Periodic Traversal in Anonymous Undirected Graphs