Universal traversal sequences with backtracking

This publication has 19 references indexed in Scilit:

• Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences
  Lecture Notes in Computer Science, 2001
• SL ⊆L^4/3
  1997
• Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five
  Information and Computation, 1995
• Lower bounds on the length of universal traversal sequences
  Journal of Computer and System Sciences, 1992
• Universal sequences for complete graphs
  Discrete Applied Mathematics, 1990
• Bounds on Universal Sequences
  SIAM Journal on Computing, 1989
• The electrical resistance of a graph captures its commute and cover times
  1989
• Multiparty protocols and logspace-hard pseudorandom sequences
  1989
• Universal traversal sequences for paths and cycles
  Journal of Algorithms, 1987
• Random walks, universal traversal sequences, and the complexity of maze problems
  1979