Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

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 with a bijection between its colors and the colors of the motif. This problem has applications in metabolic network analysis, an important area in bioinformatics. We give two positive results and three negative results that together draw sharp borderlines between tractable and intractable instances of the problem.
Type de document :
Communication dans un congrès
34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. Springer-Verlag, Lecture Notes in Computer Science (LNCS) (4596), pp.340-351, 2007, Lecture Notes in Computer Science (LNCS)
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00417928
Contributeur : Guillaume Fertin <>
Soumis le : jeudi 17 septembre 2009 - 11:58:55
Dernière modification le : mercredi 23 mai 2018 - 15:44:02
Document(s) archivé(s) le : mardi 15 juin 2010 - 20:48:22

Fichier

ICALP07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00417928, version 1

Citation

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. Springer-Verlag, Lecture Notes in Computer Science (LNCS) (4596), pp.340-351, 2007, Lecture Notes in Computer Science (LNCS). 〈hal-00417928〉

Partager

Métriques

Consultations de la notice

261

Téléchargements de fichiers

171