Login / Signup
How many vertex locations can be arbitrarily chosen when drawing planar graphs?
Emilio Di Giacomo
Giuseppe Liotta
Tamara Mchedlidze
Published in:
CoRR (2012)
Keyphrases
</>
planar graphs
minimum weight
undirected graph
bipartite graph
weighted graph
probabilistic model
directed graph
spanning tree
minimum spanning tree
greedy heuristic
message passing
graph structure
directed acyclic graph