Sciweavers

Share
CP
2011
Springer

CP Models for Maximum Common Subgraph Problems

8 years 2 months ago
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.
Samba Ndojh Ndiaye, Christine Solnon
Added 18 Dec 2011
Updated 18 Dec 2011
Type Journal
Year 2011
Where CP
Authors Samba Ndojh Ndiaye, Christine Solnon
Comments (0)
books