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...
Bewaard in:
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Belarusian National Technical University
2017-11-01
|
| Reeks: | Системный анализ и прикладная информатика |
| Onderwerpen: | |
| Online toegang: | https://sapi.bntu.by/jour/article/view/178 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|