Login / Signup

Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement.

Annegret HabelHans-Jörg KreowskiWalter Vogler
Published in: Theor. Comput. Sci. (1991)
Keyphrases
  • np complete
  • solving problems
  • image segmentation
  • neural network
  • np hard
  • optimization problems
  • subgraph isomorphism