Login / Signup

The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs.

Agelos GeorgakopoulosMatthias Hamann
Published in: Comb. (2019)
Keyphrases
  • planar graphs
  • max cut
  • minimum weight
  • approximate inference
  • undirected graph
  • belief propagation
  • weighted graph
  • bayesian networks
  • higher order
  • message passing
  • graph partitioning