A 4-approximation for the height of drawing 2-connected outer-planar graphs

Abstract

A graph drawing algorithm aims to create a picture of the graph, usually with vertices drawn at grid points while keeping the grid-size small. Many algorithms are known that create planar drawings of planar graphs, but most of them bound the height of the drawing in terms of the number of vertices. In this paper, we give an algorithm that draws 2-connected outer-planar graphs such that the height is a 4-approximation of the optimal height. © Springer-Verlag 2013.