Pages that link to "Item:Q3204039"
From MaRDI portal
The following pages link to High-Probability Parallel Transitive-Closure Algorithms (Q3204039):
Displayed 18 items.
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Nearly Work-Efficient Parallel Algorithm for Digraph Reachability (Q5129233) (← links)
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)