You are here

Subgraph Isomorphism

A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. This problem is known to be NP-complete. In this research we focuss on the following topics.

  • Structured domains (Graph and Maps)
  • Design of specific filters for subgraph isomorphism
  • Symmetry breaking in subgraph isomorphism
  • Decomposition in subgraph isomorphism
  • Comparison with state-of-the art techniques and algorithms