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

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 198; pp. 170 - 194
Main Author:	Meeks, Kitty
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 10.01.2016
Subjects:	Counting complexity FPTRAS Parameterised complexity Subgraph counting Counting complexity Subgraph counting FPTRAS Parameterised complexity
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!