Login / Signup
Space-Efficient Fully Dynamic DFS in Undirected Graphs.
Kengo Nakamura
Kunihiko Sadakane
Published in:
Algorithms (2019)
Keyphrases
</>
space efficient
undirected graph
data structure
directed graph
data streams
sliding window
bloom filter
range sum queries
directed acyclic graph
approximation algorithms
complex networks
spanning tree
data management
worst case
depth first search
bayesian networks
social networks