A New Algorithm for Inexact Graph Matching

The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact graph matching is the process of finding the best possible matching between two graphs when exact matching is impossible. In this paper, we propose a new algorithm for the inexact matching problem. The new algorithm decomposes the matching process into K phases, where the value of K ranges from 1 to the minimum of the numbers of nodes in the two graphs to be matched. The efficiency of the new algorithm results from the use of small values of K, significantly reducing the search space while still producing very good matchings (most of them optimal) between graphs. The algorithm is compared with the error-correcting subgraph isomorphism algorithm based on A*.

• Type: Conference
• Year: 2002
• Where: ICPR
• Authors: Adel Hlaoui, Shengrui Wang
• Keywords: Computer Vision, ICPR 2002, Inexact Graph Matching, Inexact Matching Problem, Subgraph Isomorphism Algorithm