Approximation algorithm and hardness results for defensive domination in graphs (Q2149875)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithm and hardness results for defensive domination in graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithm and hardness results for defensive domination in graphs |
scientific article |
Statements
Approximation algorithm and hardness results for defensive domination in graphs (English)
0 references
29 June 2022
0 references
domination
0 references
defensive domination
0 references
NP-completeness
0 references
graph algorithms
0 references
approximation algorithms
0 references
APX-completeness
0 references
0 references
