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...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Belarusian National Technical University
2017-11-01
|
| Seri Bilgileri: | Системный анализ и прикладная информатика |
| Konular: | |
| Online Erişim: | https://sapi.bntu.by/jour/article/view/178 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|