Login / Signup
A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs.
Raphael Steiner
Published in:
GD (2) (2023)
Keyphrases
</>
planar graphs
worst case
upper bound
lower bound
regret bounds
approximate inference
low dimensional
minimum weight
graphical models
belief propagation
greedy algorithm
euclidean space
weighted graph