 |
|
|
|
| HAL : hal-00455134, version 3 |
| arXiv : 1002.1880 |
| Fiche détaillée |  Récupérer au format |
|
|
| International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Tchèque, République (2010) |
|
|
| Versions disponibles : | v1 (09-02-2010) | v2 (10-05-2010) | v3 (15-06-2010) |
|
|
|
|
| Finding and counting vertex-colored subtrees |
|
|
Sylvain Guillemot 1Florian Sikora 2 |
|
|
| (23/08/2010) |
|
|
|
| The problems studied in this article originate in the Graph Motif problem introduced by Lacroix et al. (TCBB 2006) in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equals a given multiset of colors M. Using an algebraic framework recently introduced in Koutis (ICALP 2008) and Koutis, Williams (ICALP 2009), we obtain new FPT algorithms for Graph Motif and variants, with improved running times. We also obtain results on the counting versions of this problem, showing that the counting problem is FPT if M is a set, but becomes #W[1]-hard if M is a multiset with two colors. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Lehrstuhl Bioinformatik Jena |
|
|
|
Friedrich-Schiller Universität Jena |
|
|
| 2 : | Laboratoire d'informatique Gaspard-Monge [Marne-la-Vallée] (LIGM) |
|
|
|
CNRS – Université Paris Est Marne-la-Vallée – Ecole des Ponts ParisTech – ESIEE |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Complexité |
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00455134, version 3 | |
| http://hal.archives-ouvertes.fr/hal-00455134 | |
| oai:hal.archives-ouvertes.fr:hal-00455134 | |
| Contributeur : Florian Sikora | |
| Soumis le : Lundi 14 Juin 2010, 16:27:37 | |
| Dernière modification le : Vendredi 3 Septembre 2010, 11:01:53 | |
