The following pages link to Exact algorithms for dominating set (Q411862):
Displaying 22 items.
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- The many facets of upper domination (Q1704853) (← links)
- On the complexity of independent dominating set with obligations in graphs (Q2072059) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- On the k-rainbow domination in graphs with bounded tree-width (Q5061680) (← links)
- (Q5136272) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)
- Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803) (← links)
- THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH (Q6149022) (← links)
