Simpler, Better, Faster, Stronger: Revisiting a Successful Reduction Rule for Dominating Set

Abstract: DominatingSet is a classical NP-complete problem and also known to be W[2]-hard. Thus, there is little hope for small kernels on general graphs. However, in practice, reduction rules to heuristically shrink instances are used. In this context, Rule1 by Alber et. al. is quite successful, yet at times somewhat expensive to execute. We propose a linear time algorithm implementing and surpassing the original Rule1 formulation. Our discussions and proofs yield interesting structural insights into the reduction rule and its interplay with the DominatingSet problem. For instance, while the original formulation warrants repeated invocations of an $\mathcal{O}(n^3)$ time algorithm, we recast it to allow a single search run in linear time. Then, we propose simple, but practically significant, extensions to our algorithmic framework to prune the graph even further. The algorithm is easy to implement and highly practical.