Login / Signup

On the complexity of various parameterizations of common induced subgraph isomorphism.

Faisal N. Abu-KhzamÉdouard BonnetFlorian Sikora
Published in: Theor. Comput. Sci. (2017)
Keyphrases
  • subgraph isomorphism
  • graph matching
  • worst case
  • hard problems
  • graph databases
  • maximum common subgraph
  • upper bound
  • graphical models
  • weighted graph
  • graph pattern matching