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 11 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)
- Vertices in all minimum paired-dominating sets of block graphs (Q1928534) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
