Pages that link to "Item:Q2422769"
From MaRDI portal
The following pages link to Distributed distance computation and routing with small messages (Q2422769):
Displaying 10 items.
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Distributed distance measurement for large-scale networks. (Q1398827) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Shortest route computation in distributed systems (Q1885965) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Distributed computation on graphs (Q3953185) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)