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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 81; číslo 4; s. 702 - 716
Hlavní autori:	Jerrum, Mark, Meeks, Kitty
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.06.2015
Predmet:	Complexity Counting Counting complexity FPTRAS Graphs Parameterised complexity Parameterised complexity Counting complexity FPTRAS
ISSN:	0022-0000, 1090-2724
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!