Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00446-005-0147-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2056518357
@@ Property / OpenAlex ID: W2056518357 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+The space complexity of approximating the frequency moments
+Normal rank
@@ Property / cites work @@
+Near-Linear Time Construction of Sparse Neighborhood Covers
+Normal rank
@@ Property / cites work @@
+Routing with Polynomial Communication-Space Trade-Off
+Normal rank
@@ Property / cites work @@
+On finding common neighborhoods in massive graphs.
+Normal rank
@@ Property / cites work @@
+Q4449190
@@ Property / cites work: Q4449190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501268
@@ Property / cites work: Q5501268 / rank @@
+Normal rank
@@ Property / cites work @@
+NEW SPARSENESS RESULTS ON GRAPH SPANNERS
@@ Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / rank @@
+Normal rank
@@ Property / cites work @@
+Better streaming algorithms for clustering problems
+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 @@
+Q5501253
@@ Property / cites work: Q5501253 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Computing almost shortest paths
@@ Property / cites work: Computing almost shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+<i>(1 + εΒ)</i>             -spanner constructions for general graphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921736
@@ Property / cites work: Q2921736 / rank @@
+Normal rank
@@ Property / cites work @@
+An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths for graphs with small integer length edges
+Normal rank
@@ Property / cites work @@
+Q4945538
@@ Property / cites work: Q4945538 / rank @@
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Graph spanners
@@ Property / cites work: Graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Synchronizer for the Hypercube
@@ Property / cites work: An Optimal Synchronizer for the Hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+A trade-off between space and efficiency for routing tables
+Normal rank
@@ Property / cites work @@
+Q4829021
@@ Property / cites work: Q4829021 / rank @@
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank