NP-completeness and APX-completeness of restrained domination in graphs (Q442103): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60630583, #quickstatements; #temporary_batch_1707303357582 |
Removed claims |
||
| Property / author | |||
| Property / author: Lei Chen / rank | |||
| Property / author | |||
| Property / author: Chang-hong Lu / rank | |||
Revision as of 00:57, 12 February 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
