A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers (2010)

by C E Leiserson, T B Schardl
Venue:In Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA