Login / Signup
Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time.
Ashim Garg
Giuseppe Liotta
Published in:
Graph Drawing (1999)
Keyphrases
</>
planar graphs
dynamic programming
optimal solution
line drawings
computational complexity
pairwise
probabilistic model