A linear algorithm for compact box-drawings of trees

DOI10.1002/NET.10092MaRDI QIDQ4432764zbMATH OpenOpenAlexFDO

Authors Masud Hasan, Md. Saidur Rahman, Takao Nishizeki

Publication date 29 October 2003

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10092

zbMATH Keywords

compact drawinggraph drawingtree drawing

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 2104082
• Area-efficient algorithms for straight-line tree drawings
• scientific article; zbMATH DE number 1305404
• A near-linear area bound for drawing binary trees
• Graph Drawing
• A linear-time algorithm for the generation of trees
• Algorithms for drawing binary trees in the plane.
• scientific article; zbMATH DE number 1670677
• Area-efficient order-preserving planar straight-line drawings of ordered trees

Cited in

(7)

• Linear-time construction of treaps and Cartesian trees
• Drawing a tree on parallel lines
• On the approximability of two tree drawing conventions
• scientific article; zbMATH DE number 1974133 (Why is no real title available?)
• scientific article; zbMATH DE number 2104082 (Why is no real title available?)
• How to fit a tree in a box
• Good spanning trees in graph drawing

This page was built for publication: A linear algorithm for compact box-drawings of trees

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