Graph matching is the process of computing the similarity between two graphs. Depending on the requirement, it can be exact or inexact. Exact graph matching requires a strict correspondence between nodes of two graphs, whereas inexact matching allows some flexibility or tolerance during the graph matching. In this chapter, we describe an approximate inexact graph matching by reducing the size of the graphs using different centrality measures. Experimental evaluation shows that it can reduce running time for inexact graph matching.
翻译:图形匹配是计算两个图形之间相似性的过程。 根据要求, 它可以是精确的, 也可以是不精确的。 精确的图形匹配需要两个图形的节点之间的严格对应, 而不精确的匹配在图形匹配中允许一定的灵活性或容度。 在本章中, 我们通过使用不同的中心度测量来缩放图形的大小来描述一个大致不精确的图形匹配。 实验性评估显示它可以缩短不精确的图形匹配运行时间 。