The algorithmic complexity of mixed domination in graphs (Q533883)
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 5886219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algorithmic complexity of mixed domination in graphs |
scientific article; zbMATH DE number 5886219 |
Statements
The algorithmic complexity of mixed domination in graphs (English)
0 references
10 May 2011
0 references
mixed domination
0 references
tree
0 references
split graph
0 references
algorithm
0 references
NP-complete
0 references
0.9181552529335022
0 references
0.8892679214477539
0 references
0.8803880214691162
0 references
0.8514142632484436
0 references
0.84980708360672
0 references
