Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
<p>The paper proposes an efficient associative algorithm for dynamic update of the shortest paths tree of a directed weighted graph after deleting an edge. To this end, we provide the data structure and its building along with the STAR–machine that simulates the run of associative (content–add...
Main Author: | A. S. Nepomniaschaya |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2013-01-01
|
Series: | Modelirovanie i Analiz Informacionnyh Sistem |
Subjects: | |
Online Access: | http://mais-journal.ru/jour/article/view/202 |
Similar Items
-
Прикладные аспекты использования алгоритмов ранжирования для ориентированных взвешенных графов(на примере графов социальных сетей)
by: Vitaly Vladimirovich Pechenkin, et al.
Published: (2018-12-01) -
Электрическая модель с идеальными элементами для поиска кратчайшего пути на взвешенном ориентированном графе
by: В. Ю. Гнатенко, et al.
Published: (2018-07-01) -
EVALUATION OF THE EFFECTIVENESS OF THE PROCESS OF DESIGNING ENGINES USING GRAPHS
by: Сергей Михайлович Степаненко, et al.
Published: (2020-08-01) -
Development of parallel algorithm of data processing in multiprocessor systems on examples of tasks of dynamics of industrial manipulation robot
by: A A Vnukov, et al.
Published: (2010-12-01) -
Parallel calculations by automata on direct and back spanning trees of a graph
by: Igor Burdonov, et al.
Published: (2018-10-01)