Nearly work-efficient parallel algorithm for digraph reachability
- Award ID(s):
- 1718700
- PAR ID:
- 10073838
- Date Published:
- Journal Name:
- 50th Annual ACM SIGACT Symposium on Theory of Computing
- Page Range / eLocation ID:
- 457 to 470
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

