A survey of graph edit distance

Publication Type:
Journal Article
Pattern Analysis and Applications, 2010, 13 (1), pp. 113 - 129
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2011000259OK.pdf541.03 kBAdobe PDF
Inexact graph matching has been one of the significant research foci in the area of pattern analysis. As an important way to measure the similarity between pairwise graphs error-tolerantly, graph edit distance (GED) is the base of inexact graph matching.
Please use this identifier to cite or link to this item: