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

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette

Research output: Contribution to journalArticlepeer-review

61 Scopus citations

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.

Original languageEnglish
Pages (from-to)799-811
Number of pages13
JournalJournal of Computer and System Sciences
Volume77
Issue number4
DOIs
StatePublished - 1 Jan 2011
Externally publishedYes

Keywords

  • Graph motif
  • Graph pattern matching
  • Parameterized complexity
  • Treewidth
  • W hardness

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Upper and lower bounds for finding connected motifs in vertex-colored graphs'. Together they form a unique fingerprint.

Cite this