Abstract: t The algorithm of subgraph isomorphism based on decomposition proposed by Messmer et. is analysed, and its problems are pointed out. A revised algorithm is given, which adapted the decomposition and combination procedure of the original algorithm, and re

Key words: Subgraph isomorphism, Divide and conquer, Decomposition