In this section we will present a short introduction to the most commonly used graph matching techniques. The techniques are grouped on the basis of how the matching problem is formulated, giving rise to the following categories:
Exact Graph Matching Algorithms: Have strict requirements on the preservation of the structure of the graphs across the mapping
Inexact Graph Matching Algorithms: Tolerant about structure differences in the parts of the graphs being matched
Graph Embeddings and Graph Kernels: Techniques to apply algorithms developed for vectorial representations to the graph domain; such techniques are gaining a growing interest in the recent literature
Other Matching Techniques: The structure of the graphs plays only a minor role