The complexity of secure domination problem in graphs (Q1708386)
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 complexity of secure domination problem in graphs |
scientific article; zbMATH DE number 6852326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of secure domination problem in graphs |
scientific article; zbMATH DE number 6852326 |
Statements
The complexity of secure domination problem in graphs (English)
0 references
23 March 2018
0 references
secure domination
0 references
star convex bipartite graph
0 references
doubly chordal graph
0 references
NP-completeness
0 references
APX-completeness
0 references
0.8936708569526672
0 references
0.8909232020378113
0 references
0.8885108232498169
0 references
0.8859789967536926
0 references
0.8770930171012878
0 references
