CP Models for Maximum Common Subgraph Problems

The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, or a partial subgraph, obtained by removing arcs and nodes. In this paper, we introduce two soft CSPs which model these two maximum common subgraph problems in a unified framework. We also introduce and compare different CP models, corresponding to different levels of constraint propagation.

• Type: Journal
• Year: 2011
• Where: CP
• Authors: Samba Ndojh Ndiaye, Christine Solnon
• Keywords: Artificial Intelligence, Constraint Propagation, CP 2011, Csps, Erent