The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs release_livuwnuxgzhvjneyxkakp56kkq

by Mark Jerrum, Kitty Meeks

Released as a article .

2013  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  300.0 kB
file_7bdxov5t3vhuvhzeqolb7ktzvm
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2013-08-07
Version   v1
Language   en ?
arXiv  1308.1575v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 904c9afa-63ad-4850-bc1a-2c8ae82975b2
API URL: JSON