Algorithms for subgraph isomorphism detection

Posted by Jack on Stack Overflow See other posts from Stack Overflow or by Jack
Published on 2010-04-18T13:40:56Z Indexed on 2010/04/18 13:43 UTC
Read the original article Hit count: 389

Filed under:
|
|

This a NP Complete problem. More info can be found here

http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem

The most widely used algorithm is the one proposed by Ullman. Can someone please explain the algorithm to me. I read a paper by him and couldn't understand much.

Also what other algorithms for this problem. I am working on an image processing project.

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about graph