Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
From MaRDI portal
Publication:3058704
DOI10.1007/978-3-642-17493-3_20zbMath1309.68236OpenAlexW2124435154MaRDI QIDQ3058704
Johan M. M. van Rooij, Jesper Nederlof
Publication date: 7 December 2010
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17493-3_20
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ Simplifying Inclusion–Exclusion Formulas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two techniques of combining branching and treewidth
- Improved parameterized set splitting algorithms: A Probabilistic approach
- Subexponential Algorithms for Partial Cover Problems
- Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
- A measure & conquer approach for the analysis of exact algorithms
- The Travelling Salesman Problem in Bounded Degree Graphs
- Fourier meets M\"{o}bius: fast subset convolution
- Set Partitioning via Inclusion-Exclusion
- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
- Limits and Applications of Group Algebras for Parameterized Problems
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Inclusion/Exclusion Meets Measure and Conquer
- Even Faster Algorithm for Set Splitting!
- Parameterized and Exact Computation
- Partial vs. Complete Domination: t-Dominating Set
- Graph-Theoretic Concepts in Computer Science
- On the complexity of \(k\)-SAT
