We propose a new fast algorithm for solving the Maximum Common Subgraph (MCS) problem. MCS is an NP-complete problem. In this paper, we focus on a special class of graphs, i.e. Planar Trian- gulation Graphs, which are commonly used in computer vision, pattern recognition and graphics. By exploiting the properties of Planar Trian- gulation Graphs and restricting the problem to connected MCS, for two such graphs of size n and m and their maximum common subgraph of size k, our algorithm solves the MCS problem approximately with time complexity O(nmk).
['Yao Lu', 'Horst Bunke', 'Cheng-Lin Liu']
An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs