The price of connectivity for dominating set: upper bounds and complexity (Q406321): Difference between revisions
From MaRDI portal
Latest revision as of 00:08, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The price of connectivity for dominating set: upper bounds and complexity |
scientific article |
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