Pages that link to "Item:Q442103"
From MaRDI portal
The following pages link to NP-completeness and APX-completeness of restrained domination in graphs (Q442103):
Displaying 7 items.
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← links)
- Restrained domination and its variants in extended supergrid graphs (Q2699221) (← links)
- Complexity and approximation ratio of semitotal domination in graphs (Q4583541) (← links)
- (Q5070078) (← links)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs (Q6181337) (← links)
- Total (restrained) domination in unit disk graphs (Q6614890) (← links)
