Pages that link to "Item:Q2910856"
From MaRDI portal
The following pages link to Dynamic approximate all-pairs shortest paths in undirected graphs (Q2910856):
Displaying 28 items.
- On dynamic shortest paths problems (Q639278) (← links)
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← 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)
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments (Q2828206) (← links)
- Dynamically Maintaining Shortest Path Trees under Batches of Updates (Q2868652) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier (Q2969037) (← links)
- Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs (Q3467869) (← links)
- A new approach to dynamic all pairs shortest paths (Q3581293) (← links)
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (Q4575632) (← links)
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited (Q4575765) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← 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)
- (Q5092428) (← links)
- (Q5116480) (← links)
- Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds (Q5146947) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← links)
- (Q5501281) (← links)
- Estimating all pairs shortest paths in restricted graph families: a unified approach (Q5704853) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5925609) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5972260) (← links)