Login / Signup

Approximating the Diameter of Planar Graphs in Near Linear Time.

Oren WeimannRaphael Yuster
Published in: ACM Trans. Algorithms (2016)
Keyphrases
  • planar graphs
  • minimum weight
  • worst case
  • approximate inference
  • partition function
  • weighted graph
  • upper bound
  • binary variables