Semidynamic algorithms for maintaining single-source shortest path trees
From MaRDI portal
Recommendations
Cited in
(19)- A fully dynamic algorithm for distributed shortest paths.
- Semi-dynamic breadth-first search in digraphs
- Partially dynamic maintenance of minimum weight hyperpaths
- Minimize the maximum duty in multi-interface networks
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
- Fully dynamic all pairs shortest paths with real edge weights
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Algorithmic techniques for maintaining shortest routes in dynamic networks
- Dynamically maintaining shortest path trees under batches of updates
- Min-max coverage in multi-interface networks
- Fully-dynamic approximation of betweenness centrality
- scientific article; zbMATH DE number 871917 (Why is no real title available?)
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
- Approximating Betweenness Centrality in Fully Dynamic Networks
- Lifelong planning \(\text{A}^*\)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
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)
