A note on minimum-area upward drawing of complete and Fibonacci trees
DOI10.1016/0020-0190(96)81422-0zbMATH Open1185.68791OpenAlexW2085505312WikidataQ127908604 ScholiaQ127908604MaRDI QIDQ970209FDOQ970209
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
Cited In (11)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES
- 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
- Title not available (Why is that?)
- 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
- On Upward Drawings of Trees on a Given Grid
- 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)
