Login / Signup

A sufficient condition for a planar graph to be (F, F2)-partitionable.

Runrun LiuWeifan Wang
Published in: Discret. Appl. Math. (2022)
Keyphrases
  • sufficient conditions
  • planar graphs
  • approximate inference
  • lyapunov function
  • exponential stability
  • graphical models
  • belief propagation
  • linear complementarity problem
  • minimum weight
  • model selection