Theoretically efficient parallel graph algorithms can be fast and scalable
- Award ID(s):
- 1845763
- NSF-PAR ID:
- 10317728
- Date Published:
- Journal Name:
- ACM transactions on parallel computing
- ISSN:
- 2329-4949
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1145/3210377.3210414
