Filtering for Subgraph Isomorphism - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Filtering for Subgraph Isomorphism

Résumé

A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph isomorphism. This partial order over labels is used to filter domains. Labelings can also be strengthened by adding information from the labels of the neighbors. Such a strengthening can be applied iteratively until a fixpoint is reached. Practical experiments illustrate that our new filtering approach is more effective than state-of-the-art dedicated algorithms for scale free networks.
Fichier principal
Vignette du fichier
Liris-2940.pdf (223.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01502145 , version 1 (05-04-2017)

Identifiants

  • HAL Id : hal-01502145 , version 1

Citer

Stéphane Zampelli, Yves Deville, Christine Solnon, Sébastien Sorlin, Pierre Dupont. Filtering for Subgraph Isomorphism. 13th International Conference on Principles and Practice of Constraint Programming (CP'2007), Sep 2007, Providence, United States. pp.728-742. ⟨hal-01502145⟩
436 Consultations
175 Téléchargements

Partager

Gmail Facebook X LinkedIn More