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

•Contextual Similarities are proposed using Tensor Product Graph for graph matching.•CS are obtained by diffusing the pairwise ones in the context of entire graph.•Graph matching is formulated as a function of CS & solved with a linear programming.•Well defined constraints are used to guide the node and edge selection procedure.