Geodesic
Associative Parallel Algorithm for Dynamic Update of the Shortest Paths~Tree
Modelirovanie i analiz informacionnyh sistem, Tome 20 (2013) no. 2, pp. 5-22.

Voir la notice de l'article provenant de la source Math-Net.Ru

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–addressable) parallel systems with simple single-bit processing elements and vertical processing. The associative algorithm is represented on the STAR-machine as the main procedure DeleteArcSPT that uses some auxiliary procedures. By means of the auxiliary procedures, we execute some parts of the associative parallel algorithm for dynamic update of the shortest paths tree after deleting an arc from the graph. We prove correctness of the procedure DeleteArcSPT and all its parts. We obtain that on the STAR-machine this procedure takes $O(hk)$ time, where $h$ is the number of bits required for coding the maximum of the shortest paths weights and $k$ is the number of vertices, whose shortest paths change after deleting an edge from the given graph.
Keywords: directed weighted graph, the shortest paths tree, adjacency matrix, decremental algorithm, associative parallel processor. 
@article{MAIS_2013_20_2_a0,
     author = {A. Sh. Nepomniaschaya},
     title = {Associative {Parallel} {Algorithm} for {Dynamic} {Update} of the {Shortest} {Paths~Tree}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {5--22},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2013_20_2_a0/}
}
TY  - JOUR
AU  - A. Sh. Nepomniaschaya
TI  - Associative Parallel Algorithm for Dynamic Update of the Shortest Paths~Tree
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2013
SP  - 5
EP  - 22
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2013_20_2_a0/
LA  - ru
ID  - MAIS_2013_20_2_a0
ER  - 
%0 Journal Article
%A A. Sh. Nepomniaschaya
%T Associative Parallel Algorithm for Dynamic Update of the Shortest Paths~Tree
%J Modelirovanie i analiz informacionnyh sistem
%D 2013
%P 5-22
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2013_20_2_a0/
%G ru
%F MAIS_2013_20_2_a0
A. Sh. Nepomniaschaya. Associative Parallel Algorithm for Dynamic Update of the Shortest Paths~Tree. Modelirovanie i analiz informacionnyh sistem, Tome 20 (2013) no. 2, pp. 5-22. http://geodesic.mathdoc.fr/item/MAIS_2013_20_2_a0/

[1] G. Ramalingam, “Bounded Incremental Computation”, Lecture Notes in Computer Science, 1089, Springer-Verlag, Berlin, 1996, 30–51 | DOI | MR

[2] G. Ramalingam, T. Reps, “An incremental algorithm for a generalization of the shortest paths problem”, Journal of Algorithms, 21 (1996), 267–305 | DOI | MR | Zbl

[3] D. Frigioni, A. Marchetti-Spaccamela, U. Nanni, “Semi-dynamic algorithms for maintaining single source shortest paths trees”, Algorithmica, 25 (1998), 250–274 | DOI | MR

[4] D. Frigioni, A. Marchetti-Spaccamela, U. Nanni, “Fully dynamic algorithms for maintaining shortest paths trees”, Journal of Algorithms, 34 (2000), 351–381 | DOI | MR

[5] D. Frigioni, A. Marchetti-Spaccamela, U. Nanni, “Fully dynamic shortest paths in digraphs with arbitrary arc weights”, Journal of Algorithms, 49 (2003), 86–113 | DOI | MR | Zbl

[6] A. S. Nepomniaschaya, “Associative version of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph”, Proc. of the 10-th International Conference on Parallel Computing Technologies, PaCT-2009 (Novosibirsk, Russia), Lecture Notes in Computer Science, 5698, Springer-Verlag, Berlin, 2009, 257–268 | DOI

[7] A. S. Nepomniaschaya, “Language STAR for associative and parallel computation with vertical data processing”, Parallel Computing Technologies, Proc. of the International Conference, World Scientific, Singapore, 1991, 258–265

[8] E. W. Dijkstra, “A note on two problems in connection with graphs”, Numerische Mathematik, 1 (1959), 269–271 | DOI | MR | Zbl

[9] C. C. Foster, Content Addressable Parallel Processors, Van Nostrand Reinhold Company, New York, 1976

[10] A. Sh. Nepomniaschaya, M. A. Vladyko, “A Comparison of Associative Computation Models”, Programming and Computer Software, 23:6 (1997), 319–324 | Zbl

[11] A. S. Nepomniaschaya, “Solution of path problems using associative parallel processors”, Proc. of the Intern. Conf. on Parallel and Distributed Systems, ICPADS'97 (Korea, Seoul), IEEE Computer Society Press, 1997, 610–617

[12] A. S. Nepomniaschaya, M. A. Dvoskina, “A simple implementation of Dijkstra's shortest path algorithm on associative parallel processors”, Fundamenta Informaticae, 43 (2000), 227–243 | Zbl

[13] A. S. Nepomniaschaya, “Simultaneous finding the shortest paths and distances in directed graphs using associative parallel processors”, Information Visualization, Proc. of the Intern. Conf. (IV 2003) (England, London), IEEE Computer Society, Los Alamitos, 2003, 665–670