Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs.

Published in: SPAA (2017)

Keyphrases

parallel algorithm
undirected graph
parallel computation
directed acyclic graph
cluster of workstations
parallel programming
directed graph
data mining
approximation algorithms
search algorithm
association rules
social network analysis
complex networks
depth first search
pc cluster
combinatorial search problems