Login / Signup

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

Charles E. LeisersonTao B. Schardl
Published in: SPAA (2010)
Keyphrases