Secure total domination in graphs: bounds and complexity (Q1786876)
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: Secure total domination in graphs: bounds and complexity |
scientific article; zbMATH DE number 6943438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Secure total domination in graphs: bounds and complexity |
scientific article; zbMATH DE number 6943438 |
Statements
Secure total domination in graphs: bounds and complexity (English)
0 references
25 September 2018
0 references
secure total dominating set
0 references
secure total domination number
0 references
computational complexity
0 references
approximation algorithms
0 references
0 references
0.9048961997032166
0 references
0.8911256790161133
0 references
0.8887288570404053
0 references
0.8885108232498169
0 references
0.8704881072044373
0 references
