A work-efficient algorithm for parallel unordered depth-first search.

Umut A. Acar Arthur Charguéraud Mike Rainey

Published in: SC (2015)

Keyphrases

depth first search
breadth first search
dynamic programming
benchmark problems
iterative deepening
memory space
objective function
optimal solution
computational complexity
search space
ant colony optimization
knn
search strategies
memory efficient