Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6386933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs |
scientific article; zbMATH DE number 6386933 |
Statements
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (English)
0 references
15 January 2015
0 references
minimum outer-connected domination problem
0 references
outer-connected domination decision problem
0 references
0.99999994
0 references
0.9416719
0 references
0.93492365
0 references
0.91890997
0 references
0.91580456
0 references
0.9141913
0 references
0.9141913
0 references
0.91157675
0 references
0.9050911
0 references
