27 citations · 100 across the 27 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013
Some hard families of parameterised counting problems
Mark Jerrum, Kitty Meeks
We consider parameterised subgraph-counting problems of the following form: given a graph G, how many k-tuples of its vertices have a given property? A number of such problems are…
cs.CC2013
The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs
Mark Jerrum, Kitty Meeks
We introduce a class of parameterised counting problems on graphs, p-#Induced Subgraph With Property(Φ), which generalises a number of problems which have previously been studied.…