Lecture Notes in Computer Science Volume 2912, 2004, pp 129-134

Area-Efficient Drawings of Outerplanar Graphs

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid drawing with area O(dn 1.48) in O(n) time. This implies that if d =o(n 0.52), then G can be drawn in this fashion in o(n 2) area.