Login / Signup

Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs.

Qian-Ping GuGengchun Xu
Published in: WG (2014)
Keyphrases
  • planar graphs
  • constant factor approximation algorithm
  • worst case
  • approximate inference
  • objective function
  • minimum weight
  • probabilistic model
  • markov random field
  • bipartite graph