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]

Authors

Charles E. Leiserson

This author has not been identified. Look up 'Charles E. Leiserson' in Google

Tao B. Schardl

This author has not been identified. Look up 'Tao B. Schardl' in Google