The parameterised complexity of counting connected subgraphs and graph motifs

We introduce a class of parameterised counting problems on graphs, p-#Induced Subgraph With Property(\Phi), which generalises a number of problems which have previously been studied. This paper focusses on the case in which \Phi defines a family of graphs whose edge-minimal elements all have bounded treewidth; this includes the special case in which \Phi describes the property of being connected. We show that exactly counting the number of connected induced k-vertex subgraphs in an n-vertex graph is #W[1]-hard, but on the other hand there exists an FPTRAS for the problem; more generally, we show that there exists an FPTRAS for p-#Induced Subgraph With Property(\Phi) whenever \Phi is monotone and all the minimal graphs satisfying \Phi have bounded treewidth. We then apply these results to a counting version of the Graph Motif problem.

[1]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[2]  Dániel Marx,et al.  Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[3]  Yijia Chen,et al.  The parameterized complexity of k-edge induced subgraphs , 2017, Inf. Comput..

[4]  Noga Alon,et al.  Color-coding , 1995, JACM.

[5]  Michael R. Fellows,et al.  Upper and lower bounds for finding connected motifs in vertex-colored graphs , 2011, J. Comput. Syst. Sci..

[6]  Pentti Haukkanen,et al.  On meet matrices on posets , 1996 .

[7]  Marie-France Sagot,et al.  Assessing the Exceptionality of Coloured Motifs in Networks , 2008, EURASIP J. Bioinform. Syst. Biol..

[8]  Radu Curticapean,et al.  Counting Matchings of Size k Is W[1]-Hard , 2013, ICALP.

[9]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[11]  Mark Jerrum,et al.  Some Hard Families of Parameterized Counting Problems , 2013, ACM Trans. Comput. Theory.

[12]  Riccardo Dondi,et al.  Maximum Motif Problem in Vertex-Colored Graphs , 2009, CPM.

[13]  Catherine McCartin.  Parameterized Counting Problems , 2002, MFCS.

[14]  Cristina G. Fernandes,et al.  Motif Search in Graphs: Application to Metabolic Networks , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[15]  Riccardo Dondi,et al.  Weak pattern matching in colored graphs: Minimizing the number of connected components , 2007, ICTCS.

[16]  Sylvain Guillemot,et al.  Finding and Counting Vertex-Colored Subtrees , 2010, Algorithmica.

[17]  Peter Jonsson,et al.  The complexity of counting homomorphisms seen from the other side , 2004, Theor. Comput. Sci..

[18]  G. Rota.  On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[19]  Christian Komusiewicz,et al.  Parameterized Algorithms and Hardness Results for Some Graph Motif Problems , 2008, CPM.

[20]  Yijia Chen,et al.  On Parameterized Path and Chordless Path Problems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[21]  Yijia Chen,et al.  Understanding the Complexity of Induced Subgraph Isomorphisms , 2008, ICALP.

[22]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[23]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[24]  Venkatesh Raman,et al.  Approximation Algorithms for Some Parameterized Counting Problems , 2002, ISAAC.