• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.

Faisal N. Abu-KhzamEdouard BonnetFlorian Sikora
Published in: IWOCA (2014)
Keyphrases
  • subgraph isomorphism
  • graph matching
  • graph databases
  • graph pattern matching
  • hard problems
  • worst case
  • graph mining
  • maximum common subgraph
  • database
  • data mining
  • computer vision
  • pattern recognition
  • upper bound