Area-efficient algorithms for upward straight-line tree drawings

DOI10.1007/3-540-61332-3_143MaRDI QIDQ6142897zbMATH OpenOpenAlexFDO

Authors Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61332-3_143

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Area-efficient algorithms for straight-line tree drawings
• Tree drawings revisited
• Tree drawings revisited
• Upward drawings of search trees (extended abstract)
• Strictly-upward drawings of ordered search trees

Cites work

• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• Universality considerations in VLSI circuits

Cited in

(2)

• Horton-Strahler number, rooted pathwidth and upward drawings of trees
• Upward drawings of search trees (extended abstract)

This page was built for publication: Area-efficient algorithms for upward straight-line tree drawings

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