Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs - Algorithmics Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

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

Résumé

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.
Fichier principal
Vignette du fichier
ICALP07.pdf (224.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00417928 , version 1 (17-09-2009)

Identifiants

  • HAL Id : hal-00417928 , version 1

Citer

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. pp.340-351. ⟨hal-00417928⟩
154 Consultations
239 Téléchargements

Partager

Gmail Facebook X LinkedIn More