The Graph Motif Problem Parameterized by the Structure of the Input Graph

Edouard Bonnet (1) , Florian Sikora (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

The Graph Motif problem was introduced in 2006 in the context of biological networks. It consists of deciding whether or not a multiset of colors occurs in a connected subgraph of a vertex-colored graph. Graph Motif has been analyzed from the standpoint of parameterized complexity. The main parameters which came into consideration were the size of the multiset and the number of colors. Though, in the many applications of Graph Motif, the input graph originates from real-life and has structure. Motivated by this prosaic observation, we systematically study its complexity relatively to graph structural parameters. For a wide range of parameters, we give new or improved FPT algorithms, or show that the problem remains intractable. Interestingly, we establish that Graph Motif is W[1]-hard (while in W[P]) for parameter max leaf number, which is, to the best of our knowledge, the first problem to behave this way.

Mots clés: Graph Motif; FPT; Parameterized Complexity; Structural Parameters; Computational Biology

Domaines: Informatique [cs]

Edouard Bonnet, Florian Sikora. The Graph Motif Problem Parameterized by the Structure of the Input Graph. 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.319--330, ⟨10.4230/LIPIcs.IPEC.2015.319⟩. ⟨hal-01505505⟩