Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph

Publication date 5 April 2018

adjacency matrix time complexity associative parallel processor decremental algorithm directed weighted graph access data by contents subgraph of the shortest paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Parallel algorithms in computer science (68W10)

Recommendations

Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph
Parallel implementation of the Ramalingam incremental algorithm for dynamic updating the shortest-paths subgraph
An associative version of the Ramalingam decremental algorithm for the dynamic all-pairs shortest-path problem
Decremental associative algorithm for updating the shortest paths tree
Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem

Cited in

(6)

This page was built for publication: Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610076)