Login / Signup

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems

Romas AleliunasRichard M. KarpRichard J. LiptonLászló LovászCharles Rackoff
Published in: FOCS (1979)
Keyphrases
  • random walk
  • np complete
  • directed graph
  • pairwise
  • dynamic programming
  • sufficient conditions