On the approximability of two tree drawing conventions
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Recommendations
- On the complexity of drawing trees nicely: Corrigendum
- scientific article; zbMATH DE number 1305404
- A near-linear area bound for drawing binary trees
- Minimum-layer drawings of trees (extended abstract)
- Euclidean greedy drawings of trees
- Euclidean greedy drawings of trees
- Order-preserving drawings of trees with approximately optimal height (and small width)
- On treewidth approximations
- A linear algorithm for compact box-drawings of trees
- Nearly optimal monotone drawing of trees
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- A note on optimal area algorithms for upward drawings of binary trees
- A note on parallel algorithms for optimal h-v drawings of binary trees
- Algorithms for drawing graphs: An annotated bibliography
- Approximate solution of NP optimization problems
- Optimal orientations of cells in slicing floorplan designs
- PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
- TWO TREE DRAWING CONVENTIONS
Cited in
(2)
This page was built for publication: On the approximability of two tree drawing conventions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294876)
