Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136)
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 aspects of k-tuple total domination in graphs |
scientific article; zbMATH DE number 6098093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of \(k\)-tuple total domination in graphs |
scientific article; zbMATH DE number 6098093 |
Statements
Algorithmic aspects of \(k\)-tuple total domination in graphs (English)
0 references
23 October 2012
0 references
graph algorithms
0 references
domination
0 references
total domination
0 references
\(k\)-tuple total domination
0 references
NP-complete
0 references
APX-complete
0 references
0.919234335422516
0 references
0.9023764133453368
0 references
0.8815930485725403
0 references
0.8747227787971497
0 references
0.8590622544288635
0 references
