Software Architecture Recovery through Graph Mining Technique and Reduction of Complexity Involved in A* Algorithm through Stable Marriage Problem

uthor	Pavankumar Kolla , Kolla HariPriyanka, R Manjula.
On Pages	41-46
Volume No.	1
Issue No.	2
Issue Date	May 01, 2011
Publishing Date	May 01, 2011
Keywords	Reverse Engineering, spanning tree, bipartite graph, AQL, Software Architecture recovery, Graph Matching Problem.

Abstract

This paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining Techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the major step in the software architecture recovery. Many algorithms are proposed for this, for example Apriori based. In this paper to find the frequent data sets and a maximum association between the graphs we used an efficient algorithm called TMGM (tree based Maximal Graph Mining Technique)....

Download Link

http://www.scientific-journals.org/Download_May_pdf_1.php