A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem

Résumé

The maximum common subgraph problem is an NP-hard problem which is very difficult to solve with exact approaches. To speedup the solution process, we may decompose it into independent sub-problems which are solved in parallel. We describe a new decomposition method which exploits the structure of the problem to decompose it. We compare this structural decomposition with domain-based decompositions, which basically split variable domains. Experimental results show us that the structural decomposition leads to better speedups on two classes of instances, and to worse speedups on one class of instances.
Fichier principal
Vignette du fichier
finalVersion.pdf (2.62 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01191605 , version 1 (11-09-2015)

Identifiants

  • HAL Id : hal-01191605 , version 1

Citer

Maël Minot, Samba Ndojh Ndiaye, Christine Solnon. A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem. 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2015, Vierti sul Mare, Italy. pp.461-468. ⟨hal-01191605⟩
110 Consultations
202 Téléchargements

Partager

Gmail Facebook X LinkedIn More