Abstract
Abstract Graph similarity is the process of finding similarity between two graphs. Graph edit distance is one of the key techniques to find the similarity between two graphs. The main disadvantage of graph edit distance is that it is computationally expensive and in order to do exhaustive search, it has to perform exponential computation. Whereas for tree, which is a special kind of graph, we have relatively efficient method known as tree edit distance, which finds the minimum number of modifications required to convert one tree to another. In this paper we use tree edit distance to find the similarity between two graphs. To find the similarity between two graph we convert them to spanning trees, find the tree edit distance between these two spanning tree, and then augment the tree edit distance with additional edit operations to perform the graph matching.KeywordsGraph similarityTree edit distanceGraph edit distance
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
