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

DOI10.1016/0020-0190(96)81422-0MaRDI QIDQ970209zbMATH OpenOpenAlexWikidataFDO

Authors 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

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) 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) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• A note on optimal area algorithms for upward drawings of binary trees
• Tree drawings revisited
• Tree drawings revisited
• Area-efficient algorithms for straight-line tree drawings
• A near-linear area bound for drawing binary trees

Cites work

• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 578252 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• 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
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis

Cited in

(11)

• Tree drawings revisited
• On upward drawings of trees on a given grid
• ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
• A note on optimal area algorithms for upward drawings of binary trees
• Maximum upward planar subgraphs of embedded planar digraphs
• AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• How to draw a clustered tree
• Improved Upper and Lower Bounds for LR Drawings of Binary Trees
• Proximity drawings of high-degree trees
• Tree drawings revisited

This page was built for publication: A note on minimum-area upward drawing of complete and Fibonacci trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970209)