Login / Signup
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier.
Surender Baswana
Shreejit Ray Chaudhury
Keerti Choudhary
Shahbaz Khan
Published in:
SIAM J. Comput. (2019)
Keyphrases
</>
undirected graph
directed graph
depth first search
directed acyclic graph
query processing
multi dimensional
image processing
data structure
computational complexity
hidden markov models
higher order
gray scale
approximation algorithms
disjoint paths