27 citations · 100 across the 27 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 2 cited
The parameterised complexity of counting even and odd induced subgraphs
Mark Jerrum, Kitty Meeks
We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting t…
cs.CC2014
The challenges of unbounded treewidth in parameterised subgraph counting problems
Kitty Meeks
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.…