Threaded block-parallel algorithm for finding the shortest paths on graph
The problem of finding the shortest paths on weighted graphs is considered. The variants of statement of the problem, known algorithms for it solving, areas of practical application and existing challenges, in particular, the challenge of scalability, are analyzed. The class of block-parallel algori...
Main Authors: | O. N. Karasik, A. A. Prihozhy |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-06-01
|
Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
Subjects: | |
Online Access: | https://doklady.bsuir.by/jour/article/view/969 |
Similar Items
-
HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
by: A. A. Prihozhy, et al.
Published: (2017-11-01) -
Performance of shortest path algorithm based on parallel vertex traversal
by: Vesović Mihailo, et al.
Published: (2016-01-01) -
Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
by: A. S. Nepomniaschaya
Published: (2013-04-01) -
A single-source shortest path algorithm for dynamic graphs
by: Muteb Alshammari, et al.
Published: (2020-09-01) -
Shortest Path Problems: Multiple Paths in a Stochastic Graph
by: Chase, Melissa
Published: (2003)