Login / Signup

Expected Runtime Comparisons Between Breadth-First Search and Constant-Depth Restarting Random Walks.

Daniel PlatnickRichard Anthony Valenzano
Published in: CoRR (2024)
Keyphrases
  • random walk
  • breadth first search
  • depth first search
  • directed graph
  • markov chain
  • search algorithm
  • graph search
  • link prediction
  • external memory
  • constraint satisfaction
  • branch and bound
  • heuristic function