Conference
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
| Τίτλος: | Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable |
|---|---|
| Συγγραφείς: | Dhulipala, Laxman, Blelloch, Guy E., Shun, Julian |
| Πηγή: | Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. :393-404 |
| Διαθεσιμότητα: | http://dl.acm.org/doi/10.1145/3210377.3210414 |
| Βάση Δεδομένων: | ACM Full-Text Collection |
| DOI: | 10.1145/3210377.3210414 |
|---|