Nearly Work-Efficient Parallel DFS in Undirected Graphs
Name
3558481.3591094.pdf
Size
1.22 MB
Format
Adobe PDF
Checksum (MD5)
5f323b910a5ee969a1b720dc0f2dd9ea
Author(s)
Ghaffari, Mohsen
Grunau, Christoph
Qu, Jiahao
Date Issued
June 17, 2023
Publisher
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3558481.3591094
