New blocked all-pairs shortest paths algorithms operating on blocks of unequal sizes
In 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 multi-processor (multi-core) systems is the key for various application domains. The computational cost of solving the problem is hig...
| Auteurs principaux: | , |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
Belarusian National Technical University
2024-01-01
|
| Collection: | Системный анализ и прикладная информатика |
| Sujets: | |
| Accès en ligne: | https://sapi.bntu.by/jour/article/view/640 |