Login / Signup

Planar graphs without 7-cycles and butterflies are DP-4-colorable.

Seog-Jin KimRunrun LiuGexin Yu
Published in: Discret. Math. (2020)
Keyphrases
  • planar graphs
  • dynamic programming
  • minimum weight
  • approximate inference
  • image segmentation
  • lower bound
  • graphical models
  • pairwise
  • special case
  • parameter estimation
  • undirected graph