NP-completeness and APX-completeness of restrained domination in graphs (Q442103)
From MaRDI portal
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