Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution

In this paper, we show that; algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives algorithms that for a graph, given with a tree decomposition of width k, solve the DOMINATED SET problem in O(nk(2)3(k)) time and the problem to count the number of perfect matchings in O*(2(k)) time. Using a generalisation of fast subset convolution, we obtain faster algorithms for all [rho, sigma]-domination problems with finite or cofinite rho and sigma on tree decompositions. These include many well known graph problems. We give additional results on many more graph covering and partitioning problems.