Efficient construction of a bounded-degree spanner with low weight (Q2365175): Difference between revisions

@@ Property / cites work @@
+Q4234097
@@ Property / cites work: Q4234097 / 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 @@
+Q4268440
@@ Property / cites work: Q4268440 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886051
@@ Property / cites work: Q4886051 / rank @@
+Normal rank
@@ Property / cites work @@
+SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
+Normal rank
@@ Property / cites work @@
+Q4230362
@@ Property / cites work: Q4230362 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic fractional cascading
@@ Property / cites work: Dynamic fractional cascading / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
@@ Property / cites work: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+ENUMERATING INTERDISTANCES IN SPACE
@@ Property / cites work: ENUMERATING INTERDISTANCES IN SPACE / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining the minimal distance of a point set in polylogarithmic time
+Normal rank
@@ Property / cites work @@
+A sparse graph almost as good as the complete graph on points in \(k\) dimensions
+Normal rank
@@ Property / cites work @@
+On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems
+Normal rank