Product Graph-based Higher Order Contextual Similarities for Inexact Subgraph Matching

Anjan Dutta, Josep Lladós, Horst Bunke +1

Many algorithms formulate graph matching as an optimization of an objective function of pairwise quantification of nodes and edges of two graphs to be matched. Pairwise measurement…