Skip to Main content Skip to Navigation
Conference papers

Finding and counting vertex-colored subtrees

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Florian Sikora Connect in order to contact the contributor
Submitted on : Monday, June 14, 2010 - 4:27:37 PM
Last modification on : Saturday, January 15, 2022 - 3:58:34 AM
Long-term archiving on: : Thursday, September 23, 2010 - 5:55:03 PM


Files produced by the author(s)


  • HAL Id : hal-00455134, version 3
  • ARXIV : 1002.1880


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⟩



Les métriques sont temporairement indisponibles