On the algorithmic complexity of \(k\)-tuple total domination (Q400524): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.04.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043346507 / rank | |||
Normal rank | |||
Revision as of 21:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic complexity of \(k\)-tuple total domination |
scientific article |
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
