Programmation par contraintes pour les problèmes de plus grand sous-graphe commun

Philippe Vismara 1
1 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Constraint Programming has proven its efficiency to solve graph matching problems such as graph or subgraph isomorphism. It is much harder to compute maximum common subgraphs and this problem has received little attention in the CSP litterature. In this paper we discuss different variants of the problem. We consider how to model them with a conventional CSP solver and we focus on the connexity and symmetry topics. Finally, we present some experimental results.
Document type :
Conference papers
Complete list of metadatas

Cited literature [35 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00617163
Contributor : Philippe Vismara <>
Submitted on : Friday, August 26, 2011 - 12:29:27 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Long-term archiving on: Monday, November 12, 2012 - 3:51:01 PM

File

vismara_jfpc2011.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00617163, version 1

Collections

Citation

Philippe Vismara. Programmation par contraintes pour les problèmes de plus grand sous-graphe commun. JFPC'11 : Journées Francophones de Programmation par Contraintes, France. pp.327-335. ⟨lirmm-00617163⟩

Share

Metrics

Record views

230

Files downloads

400