2004 | OriginalPaper | Buchkapitel
Area-Efficient Drawings of Outerplanar Graphs
Autoren: Ashim Garg, Adrian Rusu
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Erschienen in:
Graph Drawing
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid drawing with area O(dn1.48) in O(n) time. This implies that if d =o(n0.52), then G can be drawn in this fashion in o(n2) area.
