Exact algorithms for dominating set
From MaRDI portal
Publication:411862
Recommendations
Cites work
- scientific article; zbMATH DE number 5604103 (Why is no real title available?)
- scientific article; zbMATH DE number 5605070 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305522 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
- A Computing Procedure for Quantification Theory
- A bottom-up method and fast algorithms for Max Independent Set
- A measure \& conquer approach for the analysis of exact algorithms
- A note on the complexity of minimum dominating set
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
- Algorithms for maximum independent sets
- An exact algorithm for the minimum dominating clique problem
- Combinatorial bounds via measure and conquer
- Design by measure and conquer. A faster exact algorithm for dominating set
- Efficiency in exponential time for domination-type problems
- Exact Algorithms for Edge Domination
- Finding a Maximum Independent Set
- Graph-Theoretic Concepts in Computer Science
- Inclusion/Exclusion Meets Measure and Conquer
- Open problems around exact algorithms
- Parameterized and Exact Computation
- Paths, Trees, and Flowers
- Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
- STACS 2005
- Which problems have strongly exponential complexity?
Cited in
(32)- Further improvements for SAT in terms of formula length
- Exact and heuristic algorithms for the domination problem
- An improved binary programming formulation for the secure domination problem
- Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
- Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}
- THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH
- A linear algorithm for secure domination in trees
- A faster algorithm for dominating set analyzed by the potential method
- Exact algorithms for maximum induced matching
- A measure \& conquer approach for the analysis of exact algorithms
- Design by measure and conquer. A faster exact algorithm for dominating set
- On the \(k\)-rainbow domination in graphs with bounded tree-width
- Parameterized and exact algorithms for class domination coloring
- Parameterized and exact algorithms for class domination coloring
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- Domination polynomials of the grid, the cylinder, the torus, and the king graph
- A heuristic approximation algorithm of minimum dominating set based on rough set theory
- A decidability result for the dominating set problem
- Branch and recharge: exact algorithms for generalized domination
- Computing the differential of a graph: hardness, approximability and exact algorithms
- Near-optimal dominating sets via random sampling
- Exact algorithms for counting 3-colorings of graphs
- Generating Faster Algorithms for d-Path Vertex Cover
- The many facets of upper domination
- Improved bounds for online dominating sets of trees
- On the complexity of independent dominating set with obligations in graphs
- A polynomial-time approximation to a minimum dominating set in a graph
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Exact algorithms for problems related to the densest \(k\)-set problem
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- Inclusion/exclusion meets measure and conquer
- Exact algorithms for weak Roman domination
This page was built for publication: Exact algorithms for dominating set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411862)
