Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs

An inexact matching algorithm for Attributed Relational Graphs is presented: according to it, two graphs are considered similar if, by using a defined set of syntactic and semantic transformations, they can be made isomorphic to each other. The matching process is carried out by using a State Space Representation: a state represents a partial solution of the matching between the graphs, and a transition between two states corresponds to the addition of a new pair of matched nodes. A set of feasibility rules are introduced for pruning states associated to partial matching solutions which do not satisfy the required graphs morphism. Results outlining the computational cost reduction achieved by the method are given with reference to a set of randomly generated graphs.