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...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Belarusian National Technical University
2017-11-01
|
| Col·lecció: | Системный анализ и прикладная информатика |
| Matèries: | |
| Accés en línia: | https://sapi.bntu.by/jour/article/view/178 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|