Pages that link to "Item:Q5687653"
From MaRDI portal
The following pages link to PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA (Q5687653):
Displaying 18 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- On the approximability of two tree drawing conventions (Q294876) (← links)
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio (Q482353) (← links)
- Three-dimensional graph drawing (Q675316) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings (Q1862119) (← links)
- Order-preserving, upward drawing of binary trees using fewer bends (Q1887067) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Drawing trees with perfect angular resolution and polynomial area (Q1943652) (← links)
- Tree drawings revisited (Q2189731) (← links)
- Tree Drawings on the Hexagonal Grid (Q3611873) (← links)
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES (Q4661881) (← links)
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees (Q5014106) (← links)
- Drawing Halin-graphs with small height (Q5050008) (← links)
- (Q5115791) (← links)
- How to fit a tree in a box (Q5925577) (← links)
