Pages that link to "Item:Q5230308"
From MaRDI portal
The following pages link to Improved distributed algorithms for exact shortest paths (Q5230308):
Displaying 15 items.
- Improvements for the thresh X2 shortest path algorithm (Q1093560) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Another adaptive distributed shortest path algorithm (Q3986974) (← links)
- (Q4508381) (← links)
- Distributed exact shortest paths in sublinear time (Q4978021) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- A novel pseudo‐polynomial approach for shortest path problems (Q6087148) (← links)
- Near-optimal approximate shortest paths and transshipment in distributed and streaming models (Q6487479) (← links)
- Reachability and shortest paths in the broadcast CONGEST model (Q6487528) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)