NP-completeness and APX-completeness of restrained domination in graphs (Q442103): 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.2012.05.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039024583 / rank | |||
Normal rank | |||
Revision as of 00:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness and APX-completeness of restrained domination in graphs |
scientific article |
Statements
NP-completeness and APX-completeness of restrained domination in graphs (English)
0 references
9 August 2012
0 references
NP-complete
0 references
APX-complete
0 references
approximation ratio
0 references
domination problems
0 references
restrained domination
0 references
