The proposal of improved inexact isomorphic graph algorithm to detect design patterns
Afnan Salem Ba-Brahem, M. Rizwan Jameel Qureshi

TL;DR
This paper introduces an improved inexact isomorphic graph algorithm for detecting design patterns in object-oriented software by leveraging UML diagram graph representations and edge set comparisons.
Contribution
It proposes a novel inexact graph isomorphic algorithm tailored for design pattern detection in UML diagrams, enhancing accuracy over existing methods.
Findings
Effective detection of design patterns in UML diagrams.
Improved accuracy with inexact graph isomorphism.
Applicable to complex object-oriented designs.
Abstract
Design patterns being applied more and more to solve the software engineering difficulties in the object oriented software design procedures. So, the design pattern detection is widely used by software industries. Currently, many solutions presented to detect the design pattern in the system design. In this paper, we will propose a new one which first; we will use the graph implementation to implement both the system design UML diagram and the design pattern UML diagram. Second, we will implement the edges for each one of the both two graphs in a set of 4-tuple elements. Then, we will apply a new inexact graph isomorphic algorithm to detect the design pattern in the system design.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Engineering Research · Advanced Software Engineering Methodologies · Software Engineering Techniques and Practices
