Pages that link to "Item:Q5495808"
From MaRDI portal
The following pages link to Fast routing table construction using small messages (Q5495808):
Displaying 13 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← 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)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Fast partial distance estimation and applications (Q2796252) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← 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)
- (Q5090922) (← links)
- Routing schemes for hybrid communication networks (Q6145044) (← links)