Decremental associative algorithm for updating the shortest paths tree
From MaRDI portal
Recommendations
- Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc
- 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
- Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph
- Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex
Cited in
(7)- Efficient update of tree paths on associative systems with bit-parallel processing
- Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex
- Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph
- 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
- scientific article; zbMATH DE number 1830934 (Why is no real title available?)
- Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc
This page was built for publication: Decremental associative algorithm for updating the shortest paths tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979824)