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...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Belarusian National Technical University
2017-11-01
|
| סדרה: | Системный анализ и прикладная информатика |
| נושאים: | |
| גישה מקוונת: | https://sapi.bntu.by/jour/article/view/178 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|