Pages that link to "Item:Q5259592"

The following pages link to Distributed approximation algorithms for weighted shortest paths (Q5259592):

Displaying 14 items.

• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
• Distributed finite-time calculation of node eccentricities, graph radius and graph diameter (Q286507) (← links)
• Lessons from the congested clique applied to MapReduce (Q896148) (← links)
• A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
• On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
• Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← 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)
• A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
• Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
• (Q5091075) (← links)
• The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
• Finding a small vertex cut on distributed networks (Q6499342) (← links)