Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Laxman Dhulipala, Guy E. Blelloch, Julian Shun. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. TOPC, 8(1), 2021. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: