The graph matching problem

作     者：Livi, Lorenzo Rizzi, Antonello 

作者机构：Univ Roma La Sapienza I-00185 Rome Italy 

出 版 物：《PATTERN ANALYSIS AND APPLICATIONS》 (模式分析与应用)

年 卷 期：2013年第16卷第3期

页      面：253-283页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Graph-based pattern recognition Inexact graph matching Graph edit distance Graph kernels Graph embedding 

摘      要：In this paper, we propose a survey concerning the state of the art of the graph matching problem, conceived as the most important element in the definition of inductive inference engines in graph-based pattern recognition applications. We review both methodological and algorithmic results, focusing on inexact graph matching procedures. We consider different classes of graphs that are roughly differentiated considering the complexity of the defined labels for both vertices and edges. Emphasis will be given to the understanding of the underlying methodological aspects of each identified research branch. A selection of inexact graph matching algorithms is proposed and synthetically described, aiming at explaining some significant instances of each graph matching methodology mainly considered in the technical literature.