Algorithmic results in secure total dominating sets on graphs (Q2136269)
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: Algorithmic results in secure total dominating sets on graphs |
scientific article; zbMATH DE number 7524427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic results in secure total dominating sets on graphs |
scientific article; zbMATH DE number 7524427 |
Statements
Algorithmic results in secure total dominating sets on graphs (English)
0 references
10 May 2022
0 references
secure total dominating set
0 references
linear-time algorithm
0 references
NP-complete
0 references
APX-complete
0 references
0.9256344437599182
0 references
0.898543119430542
0 references
0.8865429759025574
0 references
0.8807192444801331
0 references
0.8749192953109741
0 references
