Traversing Directed Eulerian Mazes

DOI10.7155/JGAA.00049MaRDI QIDQ4405605zbMATH OpenOpenAlexFDO

Authors Sandeep Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar

Publication date 23 June 2003

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/50935

zbMATH Keywords

directed graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1696520
• scientific article; zbMATH DE number 3914345
• Traversal of an unknown directed graph by a finite robot
• Backtracking problem in the traversal of an unknown directed graph by a finite robot
• scientific article; zbMATH DE number 3885310

Cited in

(13)

• Traversal of an unknown directed graph by a finite robot
• The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
• Robustness of the rotor-router mechanism
• Bounds on the cover time of parallel rotor walks
• scientific article; zbMATH DE number 1696520 (Why is no real title available?)
• On the directional movement of a collective of automata without a compass on a one-dimensional integer lattice
• Mathematical Labyrinths. Pathfinding
• Coalescing walks on rotor-router systems
• The range of a rotor walk
• Memory Efficient Anonymous Graph Exploration
• scientific article; zbMATH DE number 7324348 (Why is no real title available?)
• scientific article; zbMATH DE number 7700603 (Why is no real title available?)
• Derandomizing random walks in undirected graphs using locally fair exploration strategies

This page was built for publication: Traversing Directed Eulerian Mazes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405605)