Parallel implementation of the Ramalingam incremental algorithm for dynamic updating the shortest-paths subgraph
From MaRDI portal
Publication:2963884
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
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)