Pages that link to "Item:Q750159"
From MaRDI portal
The following pages link to On approximating the minimum independent dominating set (Q750159):
Displaying 44 items.
- On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Approximating the minimum maximal independence number (Q685520) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- The b-chromatic number of a graph (Q1283791) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF) (Q1786864) (← links)
- Nearly perfect sets in graphs (Q1842165) (← links)
- Fast algorithms for min independent dominating set (Q1941381) (← links)
- On the complexity of independent dominating set with obligations in graphs (Q2072059) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Iterative construction of the minimum independent dominating sets in hypercube graphs (Q2677356) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- Complexity of the approximation of the independent dominating set problem in the class of \(2P_3\)-free perfect graphs (Q2837369) (← links)
- (Q4472438) (← links)
- Bounds on 2-point set domination number of a graph (Q4603879) (← links)
- Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
- On Dominating Sets and Independent Sets of Graphs (Q4946835) (← links)
- Independent domination in directed graphs (Q4957541) (← links)
- Combinatorial bounds via measure and conquer (Q4962767) (← links)
- Construction of Halin graph with perfect k-ary tree and its independent domination number (Q5036750) (← links)
- On independent domination parameters of some special families of Halin graph (Q5036753) (← links)
- On the complexity of approximating the independent set problem (Q5096160) (← links)
- An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
- Algorithms – ESA 2004 (Q5464578) (← links)
- Complexity of the max cut problem with the minimal domination constraint (Q5878608) (← links)
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
- A resource assignment problem on graphs (Q6487990) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)
