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...

Full description

Bibliographic Details
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