Login / Signup
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid.
Aurora Morgana
Célia Picinin de Mello
Giovanna Sontacchi
Published in:
Electron. Notes Discret. Math. (2001)
Keyphrases
</>
dynamic programming
planar graphs
k means
computational complexity
worst case
optimal solution
np hard
probabilistic model
linear programming
low dimensional
objective function
lower bound
expectation maximization
minimum spanning tree