Graph Similarity Using Tree Edit Distance

• Published in: Structural, Syntactic, and Statistical Pattern Recognition Vol. 13813; pp. 233 - 241
• Main Authors: Dwivedi, Shri Prakash, Srivastava, Vishal, Gupta, Umesh
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2023; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Graph edit distance; Graph similarity; Tree edit distance
• ISBN: 3031230272; 9783031230271
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-031-23028-8_24

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.