Area-efficient algorithms for upward straight-line tree drawings

DOI10.1007/3-540-61332-3_143zbMATH Open1529.68227OpenAlexW1588350355MaRDI QIDQ6142897FDOQ6142897

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• Title not available (Why is that?)
• Universality considerations in VLSI circuits
• Title not available (Why is that?)

Cited In (1)

• 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)