Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph
From MaRDI portal
Publication:2882945
zbMATH Open1249.68140MaRDI QIDQ2882945FDOQ2882945
Authors: A. Sh. Nepomnyaschaya 
Publication date: 11 May 2012
Published in: Joint Bulletin of the Novosibirsk Computing Center (NCC) and A. P. Ershov Institute of Informatics Systems (IIS). Series: Computer Science (Search for Journal in Brave)
Recommendations
- Efficient parallel implementation of the Ramalingam decremental algorithm for updating the 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
- Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem
- Decremental associative algorithm for updating the shortest paths tree
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (6)
- Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem
- Decremental associative algorithm for updating the shortest paths tree
- An associative version of the Ramalingam decremental algorithm for the dynamic all-pairs shortest-path problem
- 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
- Parallel implementation of the Ramalingam incremental algorithm for dynamic updating the shortest-paths subgraph
This page was built for publication: Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882945)
