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

Abstract : 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.
Liste complète des métadonnées

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00606148
Contributor : Guillaume Fertin <>
Submitted on : Tuesday, July 5, 2011 - 3:17:07 PM
Last modification on : Wednesday, May 23, 2018 - 3:44:02 PM
Document(s) archivé(s) le : Thursday, October 6, 2011 - 2:25:17 AM

File

JCSS-Danny.pdf
Files produced by the author(s)

Identifiers

Citation

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, Elsevier, 2011, 77 (4), pp.799-811. ⟨10.1016/j.jcss.2010.07.003⟩. ⟨hal-00606148⟩

Share

Metrics

Record views

470

Files downloads

193