Constraint-Based Graph Matching

@inproceedings{SaintMarcq2009ConstraintBasedGM,
  title={Constraint-Based Graph Matching},
  author={Vianney le Cl{\'e}ment de Saint-Marcq and Yves Deville and Christine Solnon},
  booktitle={CP},
  year={2009}
}
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. It covers measures based on univalent matchings, such that each node is matched with at most one node, as well as multivalent matchings, such that a node may be matched with a set of nodes. This language is designed on top of Comet, a programming language supporting both Constraint Programming (CP) and Constraint… CONTINUE READING