ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS

DOI10.1142/S021819590800260XzbMath1178.05033MaRDI QIDQ3520432

Fabrizio Frati

Publication date: 26 August 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

treesgraph drawingminimum area

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Upward Planar Drawings with Three and More Slopes ⋮ Upward planar drawings with three and more slopes ⋮ Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ Drawing trees with perfect angular resolution and polynomial area ⋮ Polynomial area bounds for MST embeddings of trees

Cites Work

• Area-efficient planar straight-line drawings of outerplanar graphs
• Bipartite graphs, upward drawings, and planarity
• Upward drawings of triconnected digraphs.
• Algorithms for plane representations of acyclic digraphs
• Area requirement and symmetry display of planar upward drawings
• A note on optimal area algorithms for upward drawings of binary trees
• A near-linear area bound for drawing binary trees
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• HOW TO DRAW A SERIES-PARALLEL DIGRAPH
• AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
• Upward Planar Drawing of Single-Source Acyclic Digraphs

This page was built for publication: ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS