CP models for maximum common subgraph problems

Authors:
Samba Ndojh Ndiaye;Christine Solnon
Affiliations:
Université de Lyon, CNRS, LIRIS, UMR5205, France;Université de Lyon, CNRS, LIRIS, UMR5205, France
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 10
Cited 0

Finding a maximum clique in an arbitrary graph

SIAM Journal on Computing
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
Cost-Based Domain Filtering

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Specific Filtering Algorithms for Over-Constrained Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Constraint Catalogue: Past, Present and Future

Constraints
A parametric filtering algorithm for the graph isomorphism problem

Constraints
Generalised arc consistency for the AllDifferent constraint: An empirical survey

Artificial Intelligence
AllDifferent-based filtering for subgraph isomorphism

Artificial Intelligence
Solving subgraph isomorphism problems with constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.