An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs
In this paper we present a new algorithm that constructs
an orthogonal drawing of a graph $G$ with degree at most three.
Even if we do not require any limitations neither
to planar nor to biconnected graphs, we reach the best known results
in the literarture: each edge
has at most 1 bend, the total number of
bends is $\leq {n \over 2}+1$, and the area is
$\leq ({n \over 2}-1)^2$.