On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-013-9703-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-013-9703-Z / rank | |||
Normal rank | |||
Latest revision as of 12:40, 9 December 2024
scientific article; zbMATH DE number 6544292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the minimum outer-connected dominating set problem in graphs |
scientific article; zbMATH DE number 6544292 |
Statements
On the complexity of the minimum outer-connected dominating set problem in graphs (English)
0 references
23 February 2016
0 references
dominating set
0 references
outer-connected dominating set
0 references
NP-complete
0 references
APX-complete
0 references
