论文标题
使用中心度度量的不精确图匹配
Inexact Graph Matching Using Centrality Measures
论文作者
论文摘要
图形匹配是计算两个图之间的相似性的过程。根据要求，它可能是确切的或不精确的。精确的图形匹配需要两个图的节点之间的严格对应关系，而不精确的匹配可以在图形匹配过程中一些灵活性或公差。在本章中，我们通过使用不同的中心度度量来减少图形的大小来描述一个近似不精确的图形匹配。实验评估表明，它可以减少不精确图匹配的运行时间。
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.
