Parallel implementation of the Ramalingam incremental algorithm for dynamic updating the shortest-paths subgraph
From MaRDI portal
Publication:2963884
zbMATH Open1374.68227MaRDI QIDQ2963884FDOQ2963884
Authors: A. Sh. Nepomnyaschaya
Publication date: 21 February 2017
Full work available at URL: http://bulletin.iis.nsk.su/files/article/nepomn_1.pdf
Recommendations
- Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph
- Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph
- Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem
- An associative version of the Ramalingam decremental algorithm for the dynamic all-pairs shortest-path problem
- Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Cited In (6)
- Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph
- Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem
- An associative version of the Ramalingam decremental algorithm for the dynamic all-pairs shortest-path problem
- Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc
- Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph
- A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates
This page was built for publication: Parallel implementation of the Ramalingam incremental algorithm for dynamic updating the shortest-paths subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963884)