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

Charles E. Leiserson, Tao B. Schardl

Browse the full SPAA paper archive.