On the approximability of two tree drawing conventions

DOI10.1016/S0020-0190(01)00280-0zbMath1338.68267OpenAlexW2011413408WikidataQ127526103 ScholiaQ127526103MaRDI QIDQ294876

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

zbMATH Keywords

computational complexitycomputational geometryapproximation algorithmstree drawing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Proximity drawings in polynomial area and volume

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solution of NP optimization problems
• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• 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
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA

This page was built for publication: On the approximability of two tree drawing conventions