Login / Signup

Partitioning planar graphs: a fast combinatorial approach for max-cut.

Frauke LiersG. Pardella
Published in: Comput. Optim. Appl. (2012)
Keyphrases
  • max cut
  • planar graphs
  • spectral graph
  • graph partitioning
  • graph model
  • theoretic framework
  • approximate inference
  • minimum weight
  • np complete problems
  • np hard
  • image segmentation
  • pairwise
  • probabilistic inference