Approximating Euclidean distances by small degree graphs (Q1317879): Difference between revisions

@@ Property / cites work @@
+Generating sparse spanners for weighted graphs
@@ Property / cites work: Generating sparse spanners for weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse spanners of weighted graphs
@@ Property / cites work: On sparse spanners of weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039784
@@ Property / cites work: Q4039784 / rank @@
+Normal rank
@@ Property / cites work @@
+Delaunay graphs are almost as good as complete graphs
+Normal rank
@@ Property / cites work @@
+Q3802644
@@ Property / cites work: Q3802644 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of graphs which approximate the complete Euclidean graph
+Normal rank
@@ Property / cites work @@
+Q3484376
@@ Property / cites work: Q3484376 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph spanners
@@ Property / cites work: Graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+The Closest Packing of Spherical Caps in <i>n</i> Dimensions
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for the all-nearest-neighbors problem
+Normal rank
@@ Property / cites work @@
+A sparse graph almost as good as the complete graph on points in \(k\) dimensions
+Normal rank