Journal
PATTERN ANALYSIS AND APPLICATIONS
Volume 16, Issue 3, Pages 253-283Publisher
SPRINGER
DOI: 10.1007/s10044-012-0284-8
Keywords
Graph-based pattern recognition; Inexact graph matching; Graph edit distance; Graph kernels; Graph embedding
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available