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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Belarusian National Technical University
2017-11-01
|
| Collection: | Системный анализ и прикладная информатика |
| Sujets: | |
| Accès en ligne: | https://sapi.bntu.by/jour/article/view/178 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|