Exact (exponential) algorithms for the dominating set problem
From MaRDI portal
Recommendations
Cited in
(63)- Efficiency in exponential time for domination-type problems
- On two techniques of combining branching and treewidth
- Vertex and edge covers with clustering properties: Complexity and algorithms
- A randomized algorithm for determining dominating sets in graphs of maximum degree five
- Pathwidth of cubic graphs and exact algorithms
- Algorithms for dominating clique problems
- Exact exponential-time algorithms for finding bicliques
- Exact algorithms for edge domination
- An improved exact algorithm for minimum dominating set in chordal graphs
- Refined parameterizations for computing colored cuts in edge-colored graphs
- Parameterized complexity of graph burning
- Analyzing the reachability problem in choice networks
- Inclusion/exclusion meets measure and conquer
- The graph motif problem parameterized by the structure of the input graph
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching
- Exact algorithms for problems related to the densest \(k\)-set problem
- Computing the differential of a graph: hardness, approximability and exact algorithms
- An exact algorithm for the minimum dominating clique problem
- Improved bottleneck domination algorithms
- Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
- A faster algorithm for dominating set analyzed by the potential method
- Assigning channels via the meet-in-the-middle approach
- Exact exponential algorithms to find a tropical connected set of minimum size
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
- An exact algorithm for connected red-blue dominating set
- Branch and Recharge: Exact Algorithms for Generalized Domination
- Exact algorithms for dominating clique problems (extended abstract)
- Exact algorithms for dominating set
- scientific article; zbMATH DE number 1320677 (Why is no real title available?)
- Lower bounds on kernelization
- scientific article; zbMATH DE number 842019 (Why is no real title available?)
- The set cover conjecture and subgraph isomorphism with a tree pattern
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.
- On the Complexity of Bounded Context Switching.
- Improved bounds for online dominating sets of trees
- Exact exponential algorithms to find tropical connected sets of minimum size
- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
- Mathematical Foundations of Computer Science 2005
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
- scientific article; zbMATH DE number 2222002 (Why is no real title available?)
- Measure and conquer: Domination -- a case study
- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
- Parameterized complexity of conflict-free set cover
- Fine-grained complexity of safety verification
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
- Finding large degree-anonymous subgraphs is hard
- Parameterized Complexity of Graph Burning
- Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}
- An exact algorithm for connected red-blue dominating set
- Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- An o( n)-approximation for submodular facility location
- Algorithms for minimum membership dominating set problem
- Quantum alternating operator ansatz for solving the minimum dominating set problem on sparse graphs with a specific structure
- On the parameterized complexity of controlling amendment and successive winners
- Dynamic parameterized problems
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Exact algorithm for network dismantling problem
- An improved exact algorithm for the domatic number problem
- Solving connected dominating set faster than \(2^n\)
- Finding a dominating set on bipartite graphs
This page was built for publication: Exact (exponential) algorithms for the dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710806)
