… We can make the models of design patterns and we can map design pattern detection problem
into learning problem. Therefore, it causes to propose automatic approaches that they do …

… In the subsequent phase, the system graph is firstly decomposed in overlapping sub-graphs …
, the approach assessment is presented. Table 2 reports the design patterns detected in this …

… , we propose the Hybrid Design Pattern Detection (HyDPD), a generalized approach for
detecting patterns that is programming-language-agnostic and combines graph analysis (GA) …

… The graph decomposition is done in such a way that the … decomposition, the subgraph
isomorphism solver identifies all embeddings of the pattern graph into the candidate subgraphs …

… pattern decomposition to a GPM system. First, the performance of pattern decomposition
algorithms depends on how to decompose the whole pattern into subpatterns. The original …

… graphs. Pande A.[9] proposed graph decomposition and graph isomorphism for detecting …
Gupta and AK Tripathi, "DNIT — A new approach for design pattern detection," International …

… subgraph matching to reduce the influence of noise elements. We train a graph embedding
model and subgraph isomorphism … is decomposed into a series of query graphs denoted as {…

… new fastest FPT-isomorphism test for graphs parameterized by treewidth. While developing
novel decomposition techniques for minor-closed graph … groups of such graphs from a purely …

… Given a data graph G, we can decompose G into a collection of small subgraphs with the …
—a new approach to maximal pattern mining using isomorphism-preserving graph embedding, …

… 2.1 Structural Graph Pattern Matching We define graph isomorphism and subgraph isomorphism,
… [81], the pattern graph was decomposed into stars (two level trees) that can be found …