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: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | http://mais-journal.ru/jour/article/view/202 |
Similar Items
-
Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
by: A. S. Nepomniaschaya
Published: (2013-04-01) -
Прикладные аспекты использования алгоритмов ранжирования для ориентированных взвешенных графов(на примере графов социальных сетей)
by: Vitaly Vladimirovich Pechenkin, et al.
Published: (2018-12-01) -
Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms
by: A. A. Prihozhy
Published: (2021-10-01) -
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
by: Vladimir V. Vasilchikov
Published: (2022-03-01) -
Simulation of direct mapped, k-way and fully associative cache on all pairs shortest paths algorithms
by: A. A. Prihozhy
Published: (2019-12-01)