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(v) in every vertex v.
Supported by the Fund for the Promotion of Research at the Technion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. Afek and E. Gafni, Distributed Algorithms for Unidirectional Networks, SIAM J. Comput., Vol. 23, No. 6, 1994, pp. 1152–1178.
M. Blum and W.J. Sakoda, On the Capability of Finite Automata in 2 and 3 Dimensional Space. In Proceeding of the Eighteenth Annual Symposium on Foundations of Computer Science, 1977. pp. 147–161.
X. Deng and C.H. Papadimitriou, Exploring an Unknown Graph. In Proceeding of the Thirty First Annual Symposium on Foundation of Computer Science, 1990, pp. 355–361.
S. Even, Graph Algorithms, Computer Science press, 1979.
S. Even, A. Litman and P. Winkler, Computing with Snakes in Directed Networks of Automata. J. of Algorithms, Vol. 24, 1997, pp. 158–170.
A. Hemmerling, Labyrinth Problems; Labyrinth-Searching Abilities of Automata, Teubner-Texte zur Mathematik, Band 114, 1989.
M.O. Rabin, Maze Threading Automata. An unpublished lecture presented at MIT and UC Berkeley, 1967.
R. Tayar, Scanning Directed Eulerian Mazes by a Finite-State Robot, Master thesis, Computer Science Department, Technion, Haifa, Israel}. In preparation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhatt, S., Even, S., Greenberg, D., Tayar, R. (2000). Traversing Directed Eulerian Mazes (Extended Abstract). In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-40064-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41183-3
Online ISBN: 978-3-540-40064-6
eBook Packages: Springer Book Archive