Fast approximate shortest paths in the congested clique (Q2064057): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00446-020-00380-5
+Normal rank
@@ Property / OpenAlex ID @@
+W3028705187
@@ Property / OpenAlex ID: W3028705187 / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Lower Bounds for Sublinear Additive Spanners
+Normal rank
@@ Property / cites work @@
+Near-linear lower bounds for distributed distance computations, even in sparse networks
+Normal rank
@@ Property / cites work @@
+A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
+Normal rank
@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+Towards tight approximation bounds for graph diameter and eccentricities
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Approximation of Distances in Graphs
@@ Property / cites work: Faster Approximation of Distances in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time
+Normal rank
@@ Property / cites work @@
+Distributed exact weighted all-pairs shortest paths in near-linear time
+Normal rank
@@ Property / cites work @@
+Algebraic methods in the congested clique
@@ Property / cites work: Algebraic methods in the congested clique / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse matrix multiplication and triangle listing in the congested clique model
+Normal rank
@@ Property / cites work @@
+Distributed Triangle Detection via Expander Decomposition
+Normal rank
@@ Property / cites work @@
+Better Approximation Algorithms for the Graph Diameter
+Normal rank
@@ Property / cites work @@
+Polylog-time and near-linear work approximation scheme for undirected shortest paths
+Normal rank
@@ Property / cites work @@
+All-Pairs Small-Stretch Paths
@@ Property / cites work: All-Pairs Small-Stretch Paths / rank @@
+Normal rank
@@ Property / cites work @@
+“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of the congested clique model
@@ Property / cites work: On the power of the congested clique model / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed exact shortest paths in sublinear time
+Normal rank
@@ Property / cites work @@
+Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed MIS via All-to-All Communication
@@ Property / cites work: Distributed MIS via All-to-All Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
+Normal rank
@@ Property / cites work @@
+Improved distributed algorithms for exact shortest paths
+Normal rank
@@ Property / cites work @@
+Congested Clique Algorithms for the Minimum Cut Problem
+Normal rank
@@ Property / cites work @@
+MST in Log-Star Rounds of Congested Clique
@@ Property / cites work: MST in Log-Star Rounds of Congested Clique / rank @@
+Normal rank
@@ Property / cites work @@
+Lessons from the congested clique applied to MapReduce
+Normal rank
@@ Property / cites work @@
+A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
+Normal rank
@@ Property / cites work @@
+Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
+Normal rank
@@ Property / cites work @@
+Q5363797
@@ Property / cites work: Q5363797 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal distributed all pairs shortest paths and applications
+Normal rank
@@ Property / cites work @@
+Thorup-Zwick emulators are universally optimal hopsets
+Normal rank
@@ Property / cites work @@
+Q4608063
@@ Property / cites work: Q4608063 / rank @@
+Normal rank
@@ Property / cites work @@
+Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
+Normal rank
@@ Property / cites work @@
+Optimal deterministic routing and sorting on the congested clique
+Normal rank
@@ Property / cites work @@
+Fast routing table construction using small messages
+Normal rank
@@ Property / cites work @@
+Fast Partial Distance Estimation and Applications
@@ Property / cites work: Fast Partial Distance Estimation and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient distributed source detection with limited bandwidth
+Normal rank
@@ Property / cites work @@
+Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds
+Normal rank
@@ Property / cites work @@
+Distributed approximation algorithms for weighted shortest paths
+Normal rank
@@ Property / cites work @@
+(Delta+1) Coloring in the Congested Clique Model
@@ Property / cites work: (Delta+1) Coloring in the Congested Clique Model / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
+Normal rank
@@ Property / cites work @@
+Congested Clique Algorithms for Graph Spanners
@@ Property / cites work: Congested Clique Algorithms for Graph Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Algorithms for Network Diameter and Girth
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithms for the diameter and radius of sparse graphs
+Normal rank
@@ Property / cites work @@
+Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
+Normal rank
@@ Property / cites work @@
+Spanners and emulators with sublinear distance errors
+Normal rank