Paper Info
Title
Fully Dynamic Depth-First Search in Directed Graphs.
Abstract
Depth-first search (DFS) is a fundamental and important algorithm in graph analysis. It is the basis of many graph algorithms such as computing strongly connected components, testing planarity, and...
Year
Venue
DocType
2020
International Conference on Very Large Data Bases
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
6
Name
Order
Citations
PageRank
YangBohua100.34
Wendong Wang282172.69
QinLu301.35
ZhangYing400.34
WangXubo500.34
LinXuemin600.34