Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7306059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree |
scientific article; zbMATH DE number 7306059 |
Statements
Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (English)
0 references
4 February 2021
0 references
computational geometry
0 references
graph drawing algorithm
0 references
rooted \(y\)-monotone minimum spanning tree
0 references
exponential area
0 references
unbounded maximum degree
0 references
0 references
0.852229118347168
0 references
0.7850717902183533
0 references
0.7839163541793823
0 references
0.7736400961875916
0 references
0.7681460380554199
0 references
