CP Models for Maximum Common Subgraph Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

CP Models for Maximum Common Subgraph Problems

Résumé

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.
Fichier principal
Vignette du fichier
final_version.pdf (258.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01354447 , version 1 (24-03-2020)

Identifiants

Citer

Samba Ndojh Ndiaye, Christine Solnon. CP Models for Maximum Common Subgraph Problems. 17th International Conference on Principles and Practice of Constraint Programming (CP), Sep 2011, Perugia, Italy. pp.637-644, ⟨10.1007/978-3-642-23786-7_48⟩. ⟨hal-01354447⟩
108 Consultations
92 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More