Nearly Work-Efficient Parallel DFS in Undirected Graphs.

Mohsen Ghaffari Christoph Grunau Jiahao Qu

Published in: CoRR (2023)

Keyphrases

undirected graph
depth first search
directed graph
approximation algorithms
data structure
computational complexity
graph structure
random graphs