SubSea: An Efficient Heuristic Algorithm for Subgraph Isomorphism

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 some others algorithms
was performed on several types of graphs. The comparison results suggest
that the approach provided here is the most effective.