Login / Signup

Acyclic 4-choosability of planar graphs.

Min ChenAndré RaspaudNicolas RousselXuding Zhu
Published in: Discret. Math. (2011)
Keyphrases
  • planar graphs
  • np hard
  • np complete
  • minimum weight
  • regression model
  • approximate inference
  • bayesian networks
  • computational complexity
  • pairwise
  • special case
  • higher order
  • bipartite graph
  • binary variables