The parameterised complexity of counting connected subgraphs and graph motifs

We introduce a family of parameterised counting problems on graphs, p-#Induced Subgraph With Property(Φ), which generalises a number of problems which have previously been studied. This paper focuses on the case in which Φ defines a family of graphs whose edge-minimal elements all have bounded treew...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 81; no. 4; pp. 702 - 716
Main Authors:	Jerrum, Mark, Meeks, Kitty
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2015
Subjects:	Complexity Counting Counting complexity FPTRAS Graphs Parameterised complexity Parameterised complexity Counting complexity FPTRAS
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!