Algorithm for α-β Subgraph Isomorphism Problem on Uncertain Graph

Subgraph query in graph set returns data graph containing query graph.When the query graph and data graph both are uncertain,this paper proposes a definition of subgraph isomorphism between uncertain graphs and a definition of α-β subgraph isomorphism matching.Expectation subgraph isomorphism between uncertain graphs is a direct extension of subgraph isomorphism between deterministic graphs on probability graph model.There are two parameters α and β which are the thresholds to restrict quality of matching between query graph and data graph.This paper elaborates features of α-β subgraph isomorphism matching in detail,analyzes the differences between it and expectation subgraph isomorphism,meanwhile proposes α-β subgraph isomorphism matching decision algorithm.