Complexity and approximation ratio of semitotal domination in graphs (Q4583541)
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: Complexity and approximation ratio of semitotal domination in graphs |
scientific article; zbMATH DE number 6930008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximation ratio of semitotal domination in graphs |
scientific article; zbMATH DE number 6930008 |
Statements
31 August 2018
0 references
semitotal domination
0 references
APX-complete
0 references
NP-completeness
0 references
Complexity and approximation ratio of semitotal domination in graphs (English)
0 references
0.9082549214363098
0 references
0.8711670637130737
0 references
0.8656063675880432
0 references
0.8620227575302124
0 references
0.8613528609275818
0 references
