Pages that link to "Item:Q5212774"
From MaRDI portal
The following pages link to Distributed exact weighted all-pairs shortest paths in near-linear time (Q5212774):
Displaying 8 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)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Distributed exact shortest paths in sublinear time (Q4978021) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds (Q5197684) (← links)
- Quadratic and near-quadratic lower bounds for the CONGEST model (Q6487481) (← links)