Subsea: An efficient heuristic algorithm for subgraph isomorphism

V. Lipets, N. Vanetik, E. Gudes

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


We present a novel approach to the problem of finding all subgraphs and induced subgraphs of a (target) graph which are isomorphic to another (pattern) graph. To attain efficiency we use a special representation of the pattern graph. We also combine our search algorithm with some known bisection algorithms. Experimental comparison with other algorithms was performed on several types of graphs. The comparison results suggest that the approach provided here is most effective when all instances of a subgraph need to be found.

Original languageEnglish
Pages (from-to)320-350
Number of pages31
JournalData Mining and Knowledge Discovery
Issue number3
StatePublished - 1 Dec 2009


  • Bisection
  • Graph algorithms
  • Heuristic
  • Subgraph isomorphism

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computer Networks and Communications


Dive into the research topics of 'Subsea: An efficient heuristic algorithm for subgraph isomorphism'. Together they form a unique fingerprint.

Cite this