A Comparative Study of Three Graph Edit Distance Algorithms

Publisher:
Springer
Publication Type:
Chapter
Citation:
Studies in Computational Intelligence Vol 205: Foundations of Computational Intelligence vol 5, 2009, 1, 205 pp. 223 - 242
Issue Date:
2009-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011000266OK.pdf688.57 kB
Adobe PDF
Graph edit distance (GED) is widely applied to similarity measurement of graphs in inexact graph matching. Due to the difficulty of defining cost functions reasonably, we do research oil two GED algorithms without cost function definition: the first is c
Please use this identifier to cite or link to this item: