DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs-Reference-Cited by-同舟云学术

DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs

Published:2024-05-30 Issue: Volume: Page:1-13
ISSN:
Container-title:Proceedings of the 38th ACM International Conference on Supercomputing
language:
Short-container-title:

Author:

Feng Yelai¹^ORCID,Wang Huaixi²^ORCID,Zhu Yining³^ORCID,Liu Xiandong⁴^ORCID,Lu Hongyi⁵^ORCID,Liu Qing⁶^ORCID

Affiliation:

1. College of Electronic Engineering, National University of Defense Technology, China and College of Computer Science and Technology, National University of Defense Technology, China

2. College of Electronic Engineering, National University of Defense Technology, China

3. Ningbo Institute of Technology, Zhejiang University, China

4. PerfXLab(Beijing) Technologies Co.,Ltd, China

5. College of Computer Science and Technology, National University of Defense Technology, China

6. College of Electrical and Computer Engineering, Technical University of Munich, Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3650200.3656600

Reference52 articles.

1. Réka Albert, Hawoong Jeong, and Albert-László Barabási. 1999. Diameter of the world-wide web. nature 401, 6749 (1999), 130–131.

2. Vladimir L’vovich Arlazarov, Yefim A Dinitz, MA Kronrod, and IgorAleksandrovich Faradzhev. 1970. On economical construction of the transitive closure of an oriented graph. In Doklady Akademii Nauk, Vol. 194. Russian Academy of Sciences, 487–488.

3. Direction-optimizing Breadth-First Search

4. Scott Beamer, Krste Asanović, and David Patterson. 2015. The GAP benchmark suite. arXiv preprint arXiv:1508.03619 (2015).

5. Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search