Sparse geometric graphs with small dilation (Q929746): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2112210934
@@ Property / OpenAlex ID: W2112210934 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+cs/0702080
@@ Property / arXiv ID: cs/0702080 / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition of multidimensional point sets with applications to             <i>k</i>             -nearest-neighbors and             <i>n</i>             -body potential fields
+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 @@
+Computing a minimum-dilation spanning tree is NP-hard
+Normal rank
@@ Property / cites work @@
+CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
+Normal rank
@@ Property / cites work @@
+Q4091004
@@ Property / cites work: Q4091004 / rank @@
+Normal rank
@@ Property / cites work @@
+The geometric dilation of finite point sets
@@ Property / cites work: The geometric dilation of finite point sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501267
@@ Property / cites work: Q5501267 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945509
@@ Property / cites work: Q4945509 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum dilation stars
@@ Property / cites work: Minimum dilation stars / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanners and message distribution in networks.
@@ Property / cites work: Spanners and message distribution in networks. / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of graphs which approximate the complete Euclidean graph
+Normal rank
@@ Property / cites work @@
+Computing Geometric Minimum-Dilation Graphs Is NP-Hard
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
@@ Property / cites work: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945521
@@ Property / cites work: Q4945521 / rank @@
+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