Upper and lower bounds for finding connected motifs in vertex-colored graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2011

Upper and lower bounds for finding connected motifs in vertex-colored graphs

Résumé

We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices whose multiset of colors equals the motif. This problem is a natural graph-theoretic pattern matching variant where we are not interested in the actual structure of the occurrence of the pattern, we only require it to preserve the very basic topological requirement of connectedness. We give two positive results and three negative results that together give an extensive picture of tractable and intractable instances of the problem.
Fichier principal
Vignette du fichier
JCSS-Danny.pdf (241.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00606148 , version 1 (05-07-2011)

Identifiants

Citer

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Upper and lower bounds for finding connected motifs in vertex-colored graphs. Journal of Computer and System Sciences, 2011, 77 (4), pp.799-811. ⟨10.1016/j.jcss.2010.07.003⟩. ⟨hal-00606148⟩
300 Consultations
214 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More