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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 198; S. 170 - 194
1. Verfasser:	Meeks, Kitty
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 10.01.2016
Schlagworte:	Counting complexity FPTRAS Parameterised complexity Subgraph counting Counting complexity Subgraph counting FPTRAS Parameterised complexity
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!