A maximum common induced subgraph measures the similarity between objects represented by graphs. Finding one is an NP-hard problem. We describe a decomposition method based on the compatibility graph that produces independent subproblems. We also present triangulation and 2-triangulation techniques that aim to achieve a good trade-off between the quality of the decomposition and the runtime needed to fulfill this decomposition. The experiments show that this method obtains very good results on difficult instances.