The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
[article]
2009
arXiv
pre-print
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 numerous relations to other graph parameters. It is a long-standing open question whether determining these numbers for a graph G on n vertices admits exact algorithms running in time less than the trivial Ω(2^n) enumeration barrier. We solve these open problems by devising parameterized algorithms for the dual of the natural
arXiv:0909.4224v1
fatcat:bvjx4me43zgt5ddhvc7bsaqwcq