Pages that link to "Item:Q4978021"

The following pages link to Distributed exact shortest paths in sublinear time (Q4978021):

Displaying 21 items.

• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
• Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
• Fast approximate shortest paths in the congested clique (Q2064057) (← links)
• Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
• Latency, capacity, and distributed minimum spanning trees (Q2119398) (← 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)
• Polylog-time and near-linear work approximation scheme for undirected shortest paths (extended abstract) (Q2817594) (← links)
• Distributed exact shortest paths in sublinear time (Q4978021) (← 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)
• Depth First Search in the Semi-streaming Model (Q5090492) (← links)
• (Q5090930) (← links)
• The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
• (Q5133970) (redirect page) (← links)
• Distributed exact weighted all-pairs shortest paths in near-linear time (Q5212774) (← links)
• Improved distributed algorithms for exact shortest paths (Q5230308) (← links)
• Near-optimal approximate shortest paths and transshipment in distributed and streaming models (Q6487479) (← links)
• Distributed planar reachability in nearly optimal time (Q6535037) (← links)
• Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)