Two relations between the parameters of independence and irredundance
Discrete Mathematics
A note on the irredundance number after vertex deletion
Discrete Mathematics
SIAM Journal on Discrete Mathematics
Vertex partitioning problems: characterization, complexity and algorithms on partial K-trees
Vertex partitioning problems: characterization, complexity and algorithms on partial K-trees
Weighted irredundance of interval graphs
Information Processing Letters
Discrete Mathematics
Concurrent Transmissions in Broadcast Networks
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Irredundance and Maximum Degree in Graphs
Combinatorics, Probability and Computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The Travelling Salesman Problem in Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
Exact Exponential Algorithms
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Kernels: annotated, proper and induced
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
Finding a maximum induced degenerate subgraph faster than 2n
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
Hi-index | 0.00 |
The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G), respectively, are conceptually linked to the domination and independence numbers and have numerous relations to other graph parameters. It has been an open question whether determining these numbers for a graph G on n vertices admits exact algorithms running in time faster than the trivial @Q(2^n@?poly(n)) enumeration, also called the 2^n-barrier. The main contributions of this article are exact exponential-time algorithms breaking the 2^n-barrier for irredundance. We establish algorithms with running times of O^@?(1.99914^n) for computing ir(G) and O^@?(1.9369^n) for computing IR(G). Both algorithms use polynomial space. The first algorithm uses a parameterized approach to obtain (faster) exact algorithms. The second one is based, in addition, on a reduction to the Maximum Induced Matching problem providing a branch-and-reduce algorithm to solve it.