Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7136878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs |
scientific article; zbMATH DE number 7136878 |
Statements
Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (English)
0 references
26 November 2019
0 references
complexity
0 references
algorithm
0 references
NP-completeness
0 references
domination
0 references
lexicographic product
0 references
0 references
0.8769153952598572
0 references
0.8735607266426086
0 references
0.8700320720672607
0 references
0.8586551547050476
0 references
0.8415758609771729
0 references
