Browsing № 4 by Author "Prihozhy, A. A."
Now showing items 1-1 of 1
-
New blocked all-pairs shortest paths algorithms operating on blocks of unequal sizes
Prihozhy, A. A.; Karasik, O. N. (БНТУ, 2023)BelarusIn real-world networks, many problems imply finding the All-Pairs Shortest Paths (APSP) and their distances in a graph. Solving the large-scale APSP problem on modern muti-processor (multi-core) systems is the key for various application domains. The computational cost of solving the problem is high, therefore in many cases approximate solutions are considered as acceptable. ...2024-01-19