Nearly Work-Efficient Parallel DFS in Undirected Graphs
Principais autores: | , , |
---|---|
Outros Autores: | |
Formato: | Artigo |
Idioma: | English |
Publicado em: |
ACM|Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
2023
|
Acesso em linha: | https://hdl.handle.net/1721.1/150981 |