Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results

Jacob Focke, Dániel Marx, Fionn Mc Inerney +4

We investigate how efficiently a well-studied family of domination-type problems can be solved on bounded-treewidth graphs. For sets $\ddot{I}ƒ,\ddot{I}$ of non-negative integers, a $(\ddot{I}ƒ,\ddot{I})$-s…