The algorithm and complexity of co-secure domination in geometric intersection graphs (Q6653927)
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: The algorithm and complexity of co-secure domination in geometric intersection graphs |
scientific article; zbMATH DE number 7959238
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The algorithm and complexity of co-secure domination in geometric intersection graphs |
scientific article; zbMATH DE number 7959238 |
Statements
The algorithm and complexity of co-secure domination in geometric intersection graphs (English)
0 references
17 December 2024
0 references
co-secure domination
0 references
geometric intersection graphs
0 references
NP-complete
0 references
APX-hard
0 references
approximation algorithm
0 references
0 references
