F. Romani, Shortest-Path Problem is not Harder than Matrix Multiplication, IPL 11 (1980) 134-136.F. Romani, Shortest-path problem is not harder than matrix multiplications, Info. Proc. Lett. 11 1980 pp.134 136.F. Romani, Shortest-path problem is not harder than matrix multiplication, ...
The 2.5D APSP algorithm, which is based on the divide-and-conquer paradigm, satisfies both of these requirements: it can utilize any extra available memory to perform asymptotically less communication, and it is rich in semiring matrix multiplications, which have high temporal locality. We start ...
The 2.5D APSP algorithm, which is based on the divide-and-conquer paradigm, satisfies both of these requirements: it can utilize any extra available memory to perform asymptotically less communication, and it is rich in semiring matrix multiplications, which have high temporal locality. We start ...