On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size |
scientific article; zbMATH DE number 6487398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size |
scientific article; zbMATH DE number 6487398 |
Statements
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (English)
0 references
30 September 2015
0 references
dominating set
0 references
complexity
0 references
algorithms
0 references
forbidden induced subgraphs
0 references
0 references
0 references
0.9076879
0 references
0 references
0 references
0.8840467
0 references
0.8834042
0 references
0.88295513
0 references
0.8800652
0 references
0.8790445
0 references
