Login / Signup

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs.

Qian-Ping GuGengchun Xu
Published in: Discret. Appl. Math. (2019)
Keyphrases
  • planar graphs
  • constant factor approximation algorithm
  • worst case
  • approximate inference
  • constant factor
  • lower bound
  • special case
  • greedy algorithm