Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
From MaRDI portal
Publication:5075810
DOI10.4230/LIPIcs.ESA.2019.65OpenAlexW2978363495MaRDI QIDQ5075810
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.02266
Related Items (2)
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dynamic shortest paths problems
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- A data structure for dynamic trees
- Fully dynamic all pairs shortest paths with real edge weights
- Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization
- Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
- Near-optimal fully-dynamic graph connectivity
- High-Probability Parallel Transitive-Closure Algorithms
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Improved Dynamic Reachability Algorithms for Directed Graphs
- An On-Line Edge-Deletion Problem
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
- A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
- A new approach to dynamic all pairs shortest paths
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Dynamic graph connectivity in polylogarithmic worst case time
- Faster Deterministic Fully-Dynamic Graph Connectivity
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
This page was built for publication: Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
