Pages that link to "Item:Q5197684"
From MaRDI portal
The following pages link to A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds (Q5197684):
Displaying 6 items.
- 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)
- 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)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
