.png){kind=icon}
Return
The graph matching problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-012-0284-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Graph-based pattern recognition
Inexact graph matching
Graph edit distance
Graph kernels
Graph embedding
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K
Organization
Cited Papers
ShareSaveShareSave
ShareSaveA Statistical Physics Perspective to Understand Social Visual Attention in Autism Spectrum Disorder.png)
Perception
PerceptionIF0
PREAI
ShareSave
View more