Semidynamic algorithms for maintaining single-source shortest path trees
From MaRDI portal
Recommendations
Cited in
(17)- Semi-dynamic breadth-first search in digraphs
- Partially dynamic maintenance of minimum weight hyperpaths
- Lifelong planning \(\text{A}^*\)
- Dynamically maintaining shortest path trees under batches of updates
- Fully-dynamic approximation of betweenness centrality
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Fully dynamic all pairs shortest paths with real edge weights
- Minimize the maximum duty in multi-interface networks
- A fully dynamic algorithm for distributed shortest paths.
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Approximating Betweenness Centrality in Fully Dynamic Networks
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- Min-max coverage in multi-interface networks
- Algorithmic techniques for maintaining shortest routes in dynamic networks
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
This page was built for publication: Semidynamic algorithms for maintaining single-source shortest path trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273931)
