The logic engine and the realization problem for nearest neighbor graphs (Q1349880): Difference between revisions

@@ Property / cites work @@
+The complexity of minimizing wire lengths in VLSI layouts
+Normal rank
@@ Property / cites work @@
+Algorithms for drawing graphs: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+Realizability of Delaunay triangulations
@@ Property / cites work: Realizability of Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+The realization problem for Euclidean minimum spanning trees is NP-hard
+Normal rank
@@ Property / cites work @@
+Fixed edge-length graph drawing is NP-hard
@@ Property / cites work: Fixed edge-length graph drawing is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit-length embedding of binary trees on a square grid
+Normal rank
@@ Property / cites work @@
+Computing proximity drawings of trees in the 3-dimensional space
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(97)84223-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2069814870
@@ Property / OpenAlex ID: W2069814870 / rank @@
+Normal rank