The challenges of unbounded treewidth in parameterised subgraph counting problems

Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with p...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 198; s. 170 - 194
Hlavný autor:	Meeks, Kitty
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 10.01.2016
Predmet:	Counting complexity FPTRAS Parameterised complexity Subgraph counting Counting complexity Subgraph counting FPTRAS Parameterised complexity
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!