The following pages link to On dynamic shortest paths problems (Q639278):
Displaying 15 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs (Q2805514) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Fully-Dynamic Approximation of Betweenness Centrality (Q3452779) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Approximating Betweenness Centrality in Fully Dynamic Networks (Q5856439) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
