Programmation par contraintes pour les problèmes de plus grand sous-graphe commun

Constraint Programming has proven its efficiency to solve graph matching problems such as graph or subgraph isomorphism. It is much harder to compute maximum common subgraphs and this problem has received little attention in the CSP litterature. In this paper we discuss different variants of the problem. We consider how to model them with a conventional CSP solver and we focus on the connexity and symmetry topics. Finally, we present some experimental results.