The algorithmic complexity of mixed domination in graphs (Q533883): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.029 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2021417413 / rank | |||
Normal rank |
Revision as of 21:29, 19 March 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