Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

CP
2011
Springer

favoriteEmaildiscussreport

178views Artificial Intelligence» more CP 2011»

CP Models for Maximum Common Subgraph Problems

12 years 4 months ago

CP Models for Maximum Common Subgraph Problems

Download liris.cnrs.fr

The distance between two graphs is usually deﬁned 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 uniﬁed framework. We also introduce and compare diﬀerent CP models, corresponding to diﬀerent levels of constraint propagation.

Samba Ndojh Ndiaye, Christine Solnon

Real-time Traffic

Artificial Intelligence | Constraint Propagation | CP 2011 | Csps | Erent |

claim paper

Related Content

» Maximum common subgraph some upper bound and lower bound results

» A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem

» The Maximum Common Subgraph Problem Faster Solutions via Vertex Cover

» Challenging Complexity of Maximum Common Subgraph Detection Algorithms A Performance Analy...

» From Rules to Constraint Programs with the Rules2CP Modelling Language

» Strong Combination of Ant Colony Optimization with Constraint Programming Optimization

» Online Structural Graph Clustering Using Frequent Subgraph Mining

» Exploiting Problem Structure for Solution Counting

» Adaptive Embedded Subgraph Algorithms using WalkSum Analysis

Post Info
More Details (n/a)

Added	18 Dec 2011
Updated	18 Dec 2011
Type	Journal
Year	2011
Where	CP
Authors	Samba Ndojh Ndiaye, Christine Solnon

Comments (0)