ABSTRACT

In the vast literature Software architecture has been recovered through graphs. During Software Architecture recovery generally matching will takes place between Source graph and Query graph. Graph matching is one of the phase in which we will find the same sub graph which is present in source graph and query graph. In most of the papers, it was stated that graph matching is complete. But in reality matching between the graphs is not appropriately complete. We call this an error in matching. In this paper we investigate the applicability of error correcting graph matching algorithm, Graph Isomorphism by Decision Tree to compensate the Software Architecture Recovery.