A graph algorithm for identification of crosscutting concerns

MaRDI QIDQ5309487zbMATH OpenFDO

Authors Gabriela Şerban, Grigoreta Sofia Moldovan

Publication date 9 October 2007

zbMATH Keywords

algorithmaspect mininggraph

Mathematics Subject Classification ID

Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Mining early aspects based on syntactical and dependency analyses
• A comparison of clustering techniques in aspect mining
• A hierarchical clustering based approach in aspect mining
• scientific article; zbMATH DE number 5199051
• A new approach for detecting design patterns by graph decomposition and graph isomorphism

Cited in

(2)

• A hierarchical clustering based approach in aspect mining
• Mining early aspects based on syntactical and dependency analyses

This page was built for publication: A graph algorithm for identification of crosscutting concerns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309487)