Login / Signup

A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs.

Kengo NakamuraKunihiko Sadakane
Published in: WALCOM (2017)
Keyphrases
  • space efficient
  • undirected graph
  • learning algorithm
  • computational complexity
  • optimal solution
  • np hard
  • worst case
  • directed graph
  • graph structure
  • depth first search
  • database
  • probabilistic model
  • sliding window