Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates
From MaRDI portal
Publication:2828206
DOI10.1145/2786022zbMath1347.68351OpenAlexW2063809699MaRDI QIDQ2828206
Mattia D'Emidio, Annalisa D'Andrea, Stefano Leucci, Guido Proietti, Daniele Frigioni
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2786022
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Dynamic multi-level overlay graphs for shortest paths
- Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
- Semidynamic algorithms for maintaining single-source shortest path trees
- On the computational complexity of dynamic graph problems
- Experimental algorithms. 6th international workshop, WEA 2007, Rome, Italy, June 6--8, 2007. Proceedings.
- Dynamically Maintaining Shortest Path Trees under Batches of Updates
- Speeding Up Dynamic Shortest-Path Algorithms
- Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
- Hierarchical Hub Labelings for Shortest Paths
- Robust Distance Queries on Massive Networks
- Emergence of Scaling in Random Networks
- Fully dynamic update of arc-flags
- Fully dynamic shortest paths in digraphs with arbitrary arc weights
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- A New Dynamic Graph Structure for Large-Scale Transportation Networks
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Shortest Path Tree Computation in Dynamic Graphs
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
- Power balance and apportionment algorithms for the United States Congress
- Maintaining shortest paths under deletions in weighted directed graphs
This page was built for publication: Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates
