Pages that link to "Item:Q4946835"
From MaRDI portal
The following pages link to On Dominating Sets and Independent Sets of Graphs (Q4946835):
Displaying 23 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
- Independent sets in graphs (Q501998) (← links)
- A lower bound on the independence number of a graph (Q1584341) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- New probabilistic upper bounds on the domination number of a graph (Q2318775) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Combinatorial properties of Farey graphs (Q2333787) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- On 2-step and hop dominating sets in graphs (Q2409527) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
- Restricted domination parameters in graphs (Q2467572) (← links)
- Continuous dynamical systems that realize discrete optimization on the hypercube (Q2503628) (← links)
- Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Multiple Domination (Q3384609) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB (Q6158062) (← links)
