C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Algorithms for Drawing Polyhedra from 3-Connected Planar Graphs.
Alen Orbanic
Marko Boben
Gasper Jaklic
Tomaz Pisanski
Published in:
Informatica (Slovenia) (2004)
Keyphrases
</>
planar graphs
objective function
worst case
bayesian networks
random walk
max cut