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...
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Belarusian National Technical University
2017-11-01
|
| Series: | Системный анализ и прикладная информатика |
| Assuntos: | |
| Acceso en liña: | https://sapi.bntu.by/jour/article/view/178 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|