A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers)

Charles E. Leiserson, Tao B. Schardl. A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers). In David A. Bader, editor, Massive Graph Analytics. pages 3-33, Chapman and Hall/CRC, 2022. [doi]

Abstract

Abstract is missing.