Login / Signup

On max cut in cubic graphs.

Tiziana CalamoneriIrene FinocchiYannis ManoussakisRossella Petreschi
Published in: Parallel Algorithms Appl. (2002)
Keyphrases
  • max cut
  • graph model
  • planar graphs
  • graph partitioning
  • np hard
  • np complete problems
  • spectral graph
  • np complete
  • min max
  • belief propagation
  • pairwise