DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs
Y Feng, H Wang, Y Zhu, X Liu, H Lu, Q Liu - Proceedings of the 38th …, 2024 - dl.acm.org
The shortest paths problem is a fundamental challenge in graph theory, with a broad range
of potential applications. The algorithms based on matrix multiplication exhibits excellent …
of potential applications. The algorithms based on matrix multiplication exhibits excellent …