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

@@ Property / author @@
-Henk G. Meijer
@@ Property / author: Henk G. Meijer / rank @@
-Normal rank
@@ Property / author @@
+Henk G. Meijer
@@ Property / author: Henk G. Meijer / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6033506
@@ Property / zbMATH DE Number: 6033506 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph drawing
@@ Property / zbMATH Keywords: graph drawing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+geometric graphs
@@ Property / zbMATH Keywords: geometric graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Euclidean minimum spanning tree
@@ Property / zbMATH Keywords: Euclidean minimum spanning tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximated proximity
@@ Property / zbMATH Keywords: approximated proximity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2011.06.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2089168252
@@ Property / OpenAlex ID: W2089168252 / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:414909