Finding and counting vertex-colored subtrees - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Finding and counting vertex-colored subtrees


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.
Fichier principal
Vignette du fichier
gramo_mfcs_cameraready.pdf (204.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00455134 , version 1 (09-02-2010)
hal-00455134 , version 2 (10-05-2010)
hal-00455134 , version 3 (14-06-2010)



Sylvain Guillemot, Florian Sikora. Finding and counting vertex-colored subtrees. International Symposium on Mathematical Foundations of Computer Science (MFCS), Jun 2010, Brno, Czech Republic. pp.405-416. ⟨hal-00455134v3⟩
302 View
309 Download



Gmail Facebook Twitter LinkedIn More