TY  - GEN
A1  - Rehfeldt, Daniel
A1  - Fujisawa, Katsuki
A1  - Koch, Thorsten
A1  - Nakao, Masahiro
A1  - Shinano, Yuji
T1  - Computing single-source shortest paths on graphs with over 8 trillion edges
N2  - This paper introduces an implementation for solving the single-source shortest path problem on distributed-memory machines. It is tailored to power-law graphs and scales to trillions of edges.
The new implementation reached 2nd and 10th place in the latest Graph500 benchmark in June 2022 and handled the largest and second-largest graphs among all participants.
T3  - ZIB-Report - 22-22 
Y1  - 2022
UR  - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/8818
UR  - https://nbn-resolving.org/urn:nbn:de:0297-zib-88180
SN  - 1438-0064
ER  -