Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph

Authors:
Anna Nepomniaschaya
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division of Russian Academy of Sciences, Novosibirsk, Russia 630090
Venue:
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Year:
2009

Citing 8
Cited 0

An incremental algorithm for a generalization of the shortest-path problem

Journal of Algorithms
Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
A simple implementation of Dijkstra's shortest path algorithm on associative parallel processors

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
New dynamic algorithms for shortest path tree computation

IEEE/ACM Transactions on Networking (TON)
Content Addressable Parallel Processors

Content Addressable Parallel Processors
Bounded Incremental Computation

Bounded Incremental Computation
Solution of Path Problems Using Associative Parallel Processors

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Fully dynamic shortest paths in digraphs with arbitrary arc weights

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an efficient implementation of the Ramalingam algorithm for dynamic updating the single-sink shortest-paths subgraph of a directed weighted graph after deletion of an edge using a model of associative (content addressable) parallel systems with vertical processing (the STAR---machine). The associative version of the Ramalingam decremental algorithm is given as the procedure DeleteArc, whose correctness is proved and the time complexity is evaluated. We compare implementations of the Ramalingam decremental algorithm and its associative version and present the main advantages of the associative version.