The Graph Motif problem parameterized by the structure of the input graph - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2017

The Graph Motif problem parameterized by the structure of the input graph

Résumé

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 mostly 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. In the many utilizations of Graph Motif, however, the input graph originates from real-life applications 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. For the FPT cases, we also give some kernelization lower bounds as well as some ETH-based lower bounds on the worst case running time. 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.
Fichier principal
Vignette du fichier
155324313888290.pdf (362.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02076324 , version 1 (22-03-2019)

Identifiants

Citer

Édouard Bonnet, Florian Sikora. The Graph Motif problem parameterized by the structure of the input graph. Discrete Applied Mathematics, 2017, 231, ⟨10.1016/j.dam.2016.11.016⟩. ⟨hal-02076324⟩
23 Consultations
97 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More