Skip to Main content Skip to Navigation
Conference papers

CP Models for Maximum Common Subgraph Problems

Samba Ndojh Ndiaye 1 Christine Solnon 1
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01354447
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Tuesday, March 24, 2020 - 1:41:46 PM
Last modification on : Wednesday, March 25, 2020 - 2:06:07 PM

File

final_version.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

287

Files downloads

329