Pages that link to "Item:Q1034626"
From MaRDI portal
The following pages link to Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626):
Displaying 4 items.
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (Q1702824) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
