Universal traversal sequences for expander graphs

https://doi.org/10.1016/0020-0190(93)90199-JGet rights and content

First page preview

First page preview
Click to open first page preview

References (8)

There are more references available in the full text version of this article.

Cited by (23)

  • Graph exploration by a finite automaton

    2005, Theoretical Computer Science
  • Tree exploration with little memory

    2004, Journal of Algorithms
  • Universal traversal sequences with backtracking

    2002, Journal of Computer and System Sciences
View all citing articles on Scopus
View full text