On the algorithmic complexity of \(k\)-tuple total domination (Q400524)
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: On the algorithmic complexity of \(k\)-tuple total domination |
scientific article; zbMATH DE number 6333617
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic complexity of \(k\)-tuple total domination |
scientific article; zbMATH DE number 6333617 |
Statements
On the algorithmic complexity of \(k\)-tuple total domination (English)
0 references
22 August 2014
0 references
\(k\)-tuple total domination
0 references
total domination
0 references
block graph
0 references
cactus
0 references
algorithm
0 references
NP-complete
0 references
undirected path graph
0 references
0 references
