Breaking the 2ⁿ-barrier for irredundance: two lines of attack
From MaRDI portal
Publication:635734
Recommendations
Cites work
- A measure \& conquer approach for the analysis of exact algorithms
- A note on the irredundance number after vertex deletion
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
- Contributions to the theory of domination, independence and irredundance in graphs
- Exact exponential algorithms.
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Fourier meets M\"{o}bius: fast subset convolution
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3884101 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 1208728 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Inclusion/Exclusion Meets Measure and Conquer
- Irredundance and Maximum Degree in Graphs
- Irredundant Set Faster Than O(2 n )
- Kernels: Annotated, Proper and Induced
- On domination and independent domination numbers of a graph
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Parametrized complexity theory.
- Properties of Hereditary Hypergraphs and Middle Graphs
- Set partitioning via inclusion-exclusion
- The complexity of irredundant sets parameterized by size
- The irredundance number and maximum degree of a graph
- The parameterized complexity of the induced matching problem
- The Private Neighbor Cube
- The Travelling Salesman Problem in Bounded Degree Graphs
- Total irredundance in graphs
- Two relations between the parameters of independence and irredundance
- Weighted irredundance of interval graphs.
Cited in
(17)- On the number of connected sets in bounded degree graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- The many facets of upper domination
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Moderately exponential time algorithms for the maximum induced matching problem
- Computing the differential of a graph: hardness, approximability and exact algorithms
- Solving target set selection with bounded thresholds faster than \(2^n\)
- On the complexity landscape of the domination chain
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- Irredundance
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Enumeration of maximal irredundant sets for claw-free graphs
- Scheduling partially ordered jobs faster than \(2^n\)
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
This page was built for publication: Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635734)
