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.
VFLib2 is a C++ library for graph isomorphism finding. It also includes an Ullman implementation: http://mivia.unisa.it/datasets/graph-database/vflib/