Login / Signup

Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time".

K. AoshimaMasao Iri
Published in: SIAM J. Comput. (1977)
Keyphrases
  • planar graphs
  • minimum weight
  • approximate inference
  • upper bound
  • higher order
  • belief propagation
  • undirected graph