A note on minimum-area upward drawing of complete and Fibonacci trees

DOI10.1016/0020-0190(96)81422-0zbMath1185.68791OpenAlexW2085505312WikidataQ127908604 ScholiaQ127908604MaRDI QIDQ970209

Luca Trevisan

Publication date: 10 May 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)81422-0

zbMATH Keywords

computational geometrygraph drawing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

PROXIMITY DRAWINGS OF HIGH-DEGREE TREES, Tree drawings revisited, On Upward Drawings of Trees on a Given Grid, Maximum upward planar subgraphs of embedded planar digraphs, AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES, Unnamed Item, How to draw a clustered tree, Improved Upper and Lower Bounds for LR Drawings of Binary Trees, Optimizing area and aspect ratio in straight-line orthogonal tree drawings

Cites Work

• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• Linear area upward drawings of AVL trees
• Unnamed Item
• Unnamed Item
• Unnamed Item