Login / Signup

Practical algorithms for branch-decompositions of planar graphs.

Zhengbing BianQian-Ping GuMingzhe Zhu
Published in: Discret. Appl. Math. (2016)
Keyphrases
  • planar graphs
  • computational complexity
  • dynamic programming
  • optimization problems
  • maximum likelihood
  • max cut