On the approximability of two tree drawing conventions
DOI10.1016/S0020-0190(01)00280-0zbMATH Open1338.68267OpenAlexW2011413408WikidataQ127526103 ScholiaQ127526103MaRDI QIDQ294876FDOQ294876
Authors: Paolo Penna 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019001002800?np=y
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on optimal area algorithms for upward drawings of binary trees
- Algorithms for drawing graphs: An annotated bibliography
- PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
- Title not available (Why is that?)
- A note on parallel algorithms for optimal h-v drawings of binary trees
- TWO TREE DRAWING CONVENTIONS
- Optimal orientations of cells in slicing floorplan designs
- Approximate solution of NP optimization problems
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)
