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

Ljiljana Brankovic, Henning Fernau, Joachim Kneis +1

The lower and the upper irredundance numbers of a graph $G$, denoted $ir(G)$ and $IR(G)$ respectively, are conceptually linked to domination and independence numbers and have numer…