Login / Signup
Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier.
Surender Baswana
Shreejit Ray Chaudhury
Keerti Choudhary
Shahbaz Khan
Published in:
CoRR (2015)
Keyphrases
</>
undirected graph
spanning tree
graph structure
directed acyclic graph
approximation algorithms
directed graph
tree structure
multicommodity flow
nearest neighbor
random variables
linear program
minimum cost