Abstract
In the rank based approach introduced by Bodlaender et al. the notion of representative
sets is applied to dynamic programming algorithms for connectivity problems parameterized by
treewidth. In this approach the tables in which partial solutions are stored are intermittently
reduced in size. This results in a speed-up of these algorithms yielding running
... read more