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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences Jg. 81; H. 4; S. 702 - 716
Hauptverfasser:	Jerrum, Mark, Meeks, Kitty
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.06.2015
Schlagworte:	Complexity Counting Counting complexity FPTRAS Graphs Parameterised complexity Parameterised complexity Counting complexity FPTRAS
ISSN:	0022-0000, 1090-2724
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!