Nearly Work-Efficient Parallel DFS in Undirected Graphs

dc.contributor.author	Ghaffari, Mohsen
dc.contributor.author	Grunau, Christoph
dc.contributor.author	Qu, Jiahao
dc.date.accessioned	2023-07-05T18:38:37Z
dc.date.available	2023-07-05T18:38:37Z
dc.date.issued	2023-06-17
dc.identifier.isbn	978-1-4503-9545-8
dc.identifier.uri	https://hdl.handle.net/1721.1/150981
dc.publisher	ACM\|Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures	en_US
dc.relation.isversionof	https://doi.org/10.1145/3558481.3591094	en_US
dc.rights	Creative Commons Attribution	en_US
dc.rights.uri	https://creativecommons.org/licenses/by-nd/4.0/	en_US
dc.source	Association for Computing Machinery	en_US
dc.title	Nearly Work-Efficient Parallel DFS in Undirected Graphs	en_US
dc.type	Article	en_US
dc.identifier.citation	Ghaffari, Mohsen, Grunau, Christoph and Qu, Jiahao. 2023. "Nearly Work-Efficient Parallel DFS in Undirected Graphs."
dc.contributor.department	Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.mitlicense	PUBLISHER_CC
dc.eprint.version	Final published version	en_US
dc.type.uri	http://purl.org/eprint/type/JournalArticle	en_US
eprint.status	http://purl.org/eprint/status/PeerReviewed	en_US
dc.date.updated	2023-07-01T07:46:32Z
dc.language.rfc3066	en
dc.rights.holder	The author(s)
dspace.date.submission	2023-07-01T07:46:33Z
mit.license	PUBLISHER_CC
mit.metadata.status	Authority Work and Publication Information Needed	en_US