Traversing Directed Eulerian Mazes

Authors:
Sandeep N. Bhatt;Shimon Even;David S. Greenberg;Rafi Tayar
Affiliations:
-;-;-;-
Venue:
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2000

Citing 5
Cited 0

Distributed Algorithms for Unidirectional Networks

SIAM Journal on Computing
Computing with snakes in directed networks of automata

Journal of Algorithms
Graph Algorithms

Graph Algorithms
On the capability of finite automata in 2 and 3 dimensional space

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Exploring an unknown graph

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two algorithms for threading directed Eulerian mazes are described. Each of these algorithms is performed by a traveling robot whose control is a finite-state automaton. Each of the algorithms puts one pebble in one of the exits of every vertex. These pebbles indicate an Eulerian cycle of the maze. The simple algorithm performs O(|V| ċ |E|) edge traversals, while the advanced one traverses every edge three times. Both algorithms use memory of size O(log dout(υ)) in every vertex υ.