Academic Journal
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
| Title: | Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable |
|---|---|
| Authors: | Dhulipala, Laxman, Blelloch, Guy E., Shun, Julian |
| Source: | ACM Transactions on Parallel Computing (TOPC). 8(1):1-70 |
| Availability: | http://dl.acm.org/doi/10.1145/3434393 |
| Database: | ACM Full-Text Collection |
Be the first to leave a comment!