The algorithmic complexity of mixed domination in graphs (Q533883): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:55, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The algorithmic complexity of mixed domination in graphs |
scientific article |
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
