OES:Subgraph Isomorphism Verification Algorithm
Wei Wang · Jisuanji gongcheng · 2011
This paper proposes a novel subgraph isomorphism verification algorithm named OES,which tries to find a subgraph isomorphism map by searching edge by edge in order to check whether a query graph is contained in some data graphs,and it can raise the verification efficiency by adjusting the edge order.A grading method for edges in query graph is provided,in which the lower score an edge gets,the higher pruning efficiency it can gain.So that good efficiency can be gained by verifying the edges in the order from higher grades to lower grades.