A work-efficient algorithm for parallel unordered depth-first search
Umut A. Acar, Arthur Charguéraud, Mike Rainey · 2015
Advances in processing power and memory technology have made multicore computers an important platform for high-performance graph-search (or graph-traversal) algorithms. Since the introduction of multicore, much progress has been made to improve parallel breadth-first search. However, less attention has been given to algorithms for unordered or loosely ordered traversals.