Login / Signup

A Satisfiability Formulation of Problems on Level Graphs.

Bert RanderathEwald SpeckenmeyerEndre BorosPeter L. HammerAlexander KoganKazuhisa MakinoBruno SimeoneOndrej Cepek
Published in: Electron. Notes Discret. Math. (2001)
Keyphrases
  • optimization problems
  • np complete
  • linear programming
  • decision problems
  • knowledge base
  • higher level
  • graph matching