On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849)
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 complexity of \k\-domination and k-tuple domination in graphs |
scientific article; zbMATH DE number 6438105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs |
scientific article; zbMATH DE number 6438105 |
Statements
On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (English)
0 references
21 May 2015
0 references
computational complexity
0 references
\(\{k\}\)-domination
0 references
\(k\)-tuple domination
0 references
split graphs
0 references
planar graphs
0 references
chordal graphs
0 references
0.8678494095802307
0 references
0.8579095602035522
0 references
0.8529118299484253
0 references
0.8474851250648499
0 references
0.8231274485588074
0 references
