Nearly Work-Efficient Parallel DFS in Undirected Graphs
Download3558481.3591094.pdf (1.216Mb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordDate issued
2023-06-17Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer SciencePublisher
ACM|Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
Citation
Ghaffari, Mohsen, Grunau, Christoph and Qu, Jiahao. 2023. "Nearly Work-Efficient Parallel DFS in Undirected Graphs."
Version: Final published version
ISBN
978-1-4503-9545-8
Collections
The following license files are associated with this item: