Document Open Access Logo

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

Authors Édouard Bonnet, Florian Sikora

Thumbnail PDF


  • Filesize: 0.55 MB
  • 12 pages

Document Identifiers

Author Details

Édouard Bonnet
Florian Sikora

Cite AsGet BibTex

Édouard Bonnet and Florian Sikora. The Graph Motif Problem Parameterized by the Structure of the Input Graph. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 319-330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)


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.
  • Parameterized Complexity
  • Structural Parameters
  • Graph Motif
  • Computational Biology


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail