Drawing a tree as a minimum spanning tree approximation (Q414909): Difference between revisions

@@ Property / Wikidata QID @@
+Q62042451
@@ Property / Wikidata QID: Q62042451 / rank @@
+Normal rank
@@ Property / cites work @@
+A near-linear area bound for drawing binary trees
@@ Property / cites work: A near-linear area bound for drawing binary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4219187
@@ Property / cites work: Q4219187 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing a Tree as a Minimum Spanning Tree Approximation
+Normal rank
@@ Property / cites work @@
+Drawing Trees with Perfect Angular Resolution and Polynomial Area
+Normal rank
@@ Property / cites work @@
+The realization problem for Euclidean minimum spanning trees is NP-hard
+Normal rank
@@ Property / cites work @@
+Polynomial Area Bounds for MST Embeddings of Trees
+Normal rank
@@ Property / cites work @@
+Drawing graphs. Methods and models
@@ Property / cites work: Drawing graphs. Methods and models / rank @@
+Normal rank
@@ Property / cites work @@
+Computing proximity drawings of trees in the 3-dimensional space
+Normal rank
@@ Property / cites work @@
+Transitions in geometric minimum spanning trees
@@ Property / cites work: Transitions in geometric minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank