Login / Signup

The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs.

R. Z. HwangRichard C. T. Lee
Published in: ISAAC (1992)
Keyphrases
  • planar graphs
  • max cut
  • np complete problems
  • dynamic programming
  • markov random field