The price of connectivity for dominating set: upper bounds and complexity (Q406321)
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 6341119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The price of connectivity for dominating set: upper bounds and complexity |
scientific article; zbMATH DE number 6341119 |
Statements
The price of connectivity for dominating set: upper bounds and complexity (English)
0 references
8 September 2014
0 references
domination
0 references
connected domination
0 references
forbidden induced subgraphs
0 references
computational complexity
0 references
0 references
0.7677651047706604
0 references
0.7677558064460754
0 references
0.767725944519043
0 references
