  Graph matching is the process of computing the similarity between two graphs.
Depending on the requirement, it can be exact or inexact. Exact graph matching
requires a strict correspondence between nodes of two graphs, whereas inexact
matching allows some flexibility or tolerance during the graph matching. In
this chapter, we describe an approximate inexact graph matching by reducing the
size of the graphs using different centrality measures. Experimental evaluation
shows that it can reduce running time for inexact graph matching.
