Pages that link to "Item:Q4625657"
From MaRDI portal
The following pages link to Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time (Q4625657):
Displaying 9 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- (Q5092428) (← links)
- Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary (Q5146946) (← links)
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)