Graph Matching (1)

Paper (2004): Thirty Years of Graph Matching in pattern recognition

1. the category of Graph Matching

1.1 exact matching algorithms

Exact matching algorithm: shocould be edge-preserving, which means if 2 nodes in the first graph are linked by an edge, they are mapped to 2 nodes in the second graph that are linked to an edge as well.

Graph isomorphism: a one-to-one corresponsor must be found between each node of the first graph and each node of the second graph.

Subgraph isomorphism: An Isomorphism holds between one of the two graphs and a node-induced subgraph of the other.

Monomorphism: each node of the first graph is mapped to a distinct node of the second one, and each edge of the first graph has a corresponding edge in the second one; the second graph, however, may have both extra nodes and extra edges.

Homomorphisim: nodes in the first graph are to be mapped to distinct nodes of the other, role-to-one.

Maximum common subgraph (MCS): map a subgraph of the first graph to an isomorphic subgraph of the second one.

 

 

2. The application of the graph matching

 

Graph Matching (1)