A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs
[article]
2014
arXiv
pre-print
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
arXiv:1308.1575v3
fatcat:fryb77k3gze65clacn6kgap4pq