Sciweavers

CCCG
2007
13 years 6 months ago
Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area
We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjectur...
Fabrizio Frati