Improved dynamic algorithms for maintaining approximate shortest paths under deletions
From MaRDI portal
Recommendations
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- A subquadratic-time algorithm for decremental single-source shortest paths
- Dynamic approximate all-pairs shortest paths in undirected graphs
- Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
- Maintaining shortest paths under deletions in weighted directed graphs
Cited in
(15)- Maintaining shortest paths under deletions in weighted directed graphs
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Dynamic single-source shortest paths in Erdős-Rényi random graphs
- scientific article; zbMATH DE number 2079363 (Why is no real title available?)
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
- A subquadratic-time algorithm for decremental single-source shortest paths
- Maintaining shortest paths under deletions in weighted directed graphs
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- A new deterministic algorithm for fully dynamic all-pairs shortest paths
- Deterministic incremental APSP with polylogarithmic update time and stretch
- New tradeoffs for decremental approximate all-pairs shortest paths
- Fully dynamic algorithms for minimum weight cycle and related problems
This page was built for publication: Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365123)
