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

  • Authors:

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

  • Affiliations:

  • Office of DVC (Research), The University of Newcastle, Callaghan NSW 2308, Australia;Laboratoire dInformatique de Nantes-Atlantique (LINA), UMR CNRS 6241, Université de Nantes, 2 rue de la Houssinière, 44322 Nantes Cedex 3, France;Algorithms and Complexity Group, Max Planck Institute for Informatics, Campus E1 4, 66123, Saarbrücken, Germany;LIGM CNRS UMR 8049 Université Paris-Est, 5 Bd Descartes, 77454 Marne-la-Vallée, France

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.