On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605): 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.1007/s10878-013-9703-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094446349 / rank | |||
Normal rank | |||
Revision as of 01:35, 20 March 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
