Area-efficient algorithms for upward straight-line tree drawings

DOI10.1007/3-540-61332-3_143zbMath1529.68227OpenAlexW1588350355MaRDI QIDQ6142897

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

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) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• Universality considerations in VLSI circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item

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