Universal traversal sequences for expander graphs
References (8)
- et al.
Explicit construction of linear-sized superconcentrators
J. Comput. System Sci.
(1981) Relationships between nondeterministic and deterministic tape complexities
J. Comput. System Sci.
(1970)- et al.
Random walks, universal traversal sequences, and the complexity of maze problems
Proc. 20th Ann. IEEE Symp. on the Foundation of Computer Science
(1979) Eigenvalues, geometric expanders, sorting in rounds and Ramsey theory
Combinatorica
(1986)
There are more references available in the full text version of this article.
Cited by (23)
Impact of memory size on graph exploration capability
2008, Discrete Applied MathematicsGraph exploration by a finite automaton
2005, Theoretical Computer ScienceTree exploration with little memory
2004, Journal of AlgorithmsLog-space constructible universal traversal sequences for cycles of length O(n<sup>4.03</sup>)
2003, Theoretical Computer ScienceUniversal traversal sequences with backtracking
2002, Journal of Computer and System SciencesTime-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
1996, Information and Computation
Copyright © 1993 Published by Elsevier B.V.