On the number of minimal dominating sets on some graph classes (Q476916)
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 number of minimal dominating sets on some graph classes |
scientific article; zbMATH DE number 6376007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of minimal dominating sets on some graph classes |
scientific article; zbMATH DE number 6376007 |
Statements
On the number of minimal dominating sets on some graph classes (English)
0 references
2 December 2014
0 references
graph algorithms
0 references
exponential-time algorithms
0 references
graph classes
0 references
dominating sets
0 references
enumerating algorithms
0 references
0 references
0 references
0.8863734006881714
0 references
0.8755350112915039
0 references
0.8750671148300171
0 references
0.8531944155693054
0 references
0.8311173319816589
0 references
