A Parameterized Route to Exact Puzzles: Breaking the 2n -Barrier for Irredundance

Abstract

<p>. The lower and the upper irredundance numbers of a graph <i>G</i>, denoted ir(<i>G</i> ) and IR(<i>G</i> ) respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a long-standing open question whether determining these numbers for a graph <i>G</i> on <i>n</i> vertices admits exact algorithms running in time less than the trivial <i>Ω</i>(2^<i>n</i>) enumeration barrier. We solve this open problem by devising parameterized algorithms for the duals of the natural parameterizations of the problems with running times faster than <i>O*</i> (4^<i>k</i>). For example, we present an algorithm running in time <i>O*</i> (3.069^<i>k</i>) for determining whether IR(<i>G</i> ) is at least <i>n − k</i> . Although the corresponding problem has been shown to be in FPT by kernelization techniques, this paper offers the first parameterized algorithms with an exponential dependency on the parameter in the running time. Furthermore, these seem to be the first examples of a parameterized approach leading to a solution to a problem in exponential time algorithmics where the natural interpretation as exact exponential-time algorithms fails.</p>