HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem are known. A new heterogeneous block algorithm is...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Belarusian National Technical University
2017-11-01
|
| Cyfres: | Системный анализ и прикладная информатика |
| Pynciau: | |
| Mynediad Ar-lein: | https://sapi.bntu.by/jour/article/view/178 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|