Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
type: Item
instance of: scholarly article
title: Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
zbMATH Open document ID: 1225.05227
author: Daniel Binkele-Raible
author: Ljiljana Brankovic
author: Marek Cygan
author: Henning Fernau
author: Joachim Kneis
author: Dieter Kratsch
author: Alexander Langer
author: Mathieu Liedloff
author: Marcin Pilipczuk
author: Peter Rossmanith
author: Jakub Onufry Wojtaszczyk
published in: Journal of Discrete Algorithms
publication date: 2011-08-23T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5941895
zbMATH Keywords: graph algorithms
zbMATH Keywords: irredundance number
MaRDI profile type: Publication
full work available at URL: j.jda.2011.03.002
OpenAlex ID: W2165086965
cites work: Kernels: Annotated, Proper and Induced
cites work: On domination and independent domination numbers of a graph
cites work: A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
cites work: The Travelling Salesman Problem in Bounded Degree Graphs
cites work: Set Partitioning via Inclusion-Exclusion
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: The irredundance number and maximum degree of a graph
cites work: Weighted irredundance of interval graphs.
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Irredundance and Maximum Degree in Graphs
cites work: Properties of Hereditary Hypergraphs and Middle Graphs
cites work: Contributions to the theory of domination, independence and irredundance in graphs
cites work: Q4211755
cites work: Q3218070
cites work: Irredundant Set Faster Than O(2 n )
cites work: Q4393480
cites work: The complexity of irredundant sets parameterized by size
cites work: Two relations between the parameters of independence and irredundance
cites work: A note on the irredundance number after vertex deletion
cites work: Total irredundance in graphs
cites work: The Private Neighbor Cube
cites work: Parametrized complexity theory.
cites work: Exact exponential algorithms.
cites work: A measure & conquer approach for the analysis of exact algorithms
cites work: Q3791195
cites work: The parameterized complexity of the induced matching problem
cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
cites work: Q5710169
cites work: Q3291034
cites work: Parameterized algorithms for feedback set problems and their duals in tournaments
cites work: Inclusion/Exclusion Meets Measure and Conquer
cites work: Q4414647
DOI: 10.1016/J.JDA.2011.03.002
description: scientific article; zbMATH DE number 5941895