Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
From MaRDI portal
Publication:4943078
DOI10.1006/jagm.1999.1048zbMath0949.68169MaRDI QIDQ4943078
Alberto Marchetti-Spaccamela, Umberto Nanni, Daniele Frigioni
Publication date: 28 August 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1048
68W05: Nonnumerical algorithms
Related Items
A single-source shortest path algorithm for dynamic graphs, The BDD-Based Dynamic A* Algorithm for Real-Time Replanning, Shortest-Path Algorithms and Dynamic Cost Changes, Fast computation of bounds for two-terminal network reliability, A loop-free shortest-path routing algorithm for dynamic networks, Finding large \(k\)-clubs in undirected graphs, Lifelong planning \(\text{A}^*\), Dynamic shortest paths and transitive closure: algorithmic techniques and data structures, Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios, A fully dynamic algorithm for distributed shortest paths., Engineering a new algorithm for distributed shortest paths on dynamic networks, Partially dynamic efficient algorithms for distributed shortest paths, Fully dynamic all pairs shortest paths with real edge weights, Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates, Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks, Dynamically Maintaining Shortest Path Trees under Batches of Updates, A survey on combinatorial optimization in dynamic environments
Uses Software
