On the complexity of some quorum colorings problems of graphs (Q5012382)
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 7389408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of some quorum colorings problems of graphs |
scientific article; zbMATH DE number 7389408 |
Statements
On the complexity of some quorum colorings problems of graphs (English)
0 references
1 September 2021
0 references
defensive alliance
0 references
quorum colorings
0 references
satisfactory partition
0 references
cost-effective partition
0 references
complexity
0 references
0.958299994468689
0 references
0.922507107257843
0 references
0.8257483243942261
0 references
0.7358314394950867
0 references
0.7273274660110474
0 references
