Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q5746254)
From MaRDI portal
scientific article; zbMATH DE number 6258742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs |
scientific article; zbMATH DE number 6258742 |
Statements
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (English)
0 references
18 February 2014
0 references
domination
0 references
outer-connected domination
0 references
NP-completeness
0 references
APX-completeness
0 references
