Pages that link to "Item:Q2933812"
From MaRDI portal
The following pages link to Optimal distributed all pairs shortest paths and applications (Q2933812):
Displayed 18 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Algebraic methods in the congested clique (Q2010605) (← 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)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- (Q5090500) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Efficient and Decentralized Polling Protocol for General Social Networks (Q5207912) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)