DMCA

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

by Charles E. Leiserson , Tao B. Schardl
Venue:In SPAA ’10: Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures
Citations:33 - 4 self