Algorithms for subgraph isomorphism detection [closed]

Question

Subgraph isomorphism is an NP Complete problem. The most widely used algorithm is the one proposed by Ullman.

Can someone please explain the algorithm to me in layman's language? I read the above paper by him, but couldn't understand much.

What other algorithms exist for this problem?

I am working on an image processing project.

Answer 1

VFLib2 is a C++ library for graph isomorphism finding. It also includes an Ullman implementation: http://mivia.unisa.it/datasets/graph-database/vflib/

Answer 2

This blog post tries to give an overview of the algorithm. The original presentation is hard to read because it presents the algorithm as you would write it on a '70s computer.