Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008)
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: Minimal dominating sets in graph classes: combinatorial bounds and enumeration |
scientific article; zbMATH DE number 6237427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal dominating sets in graph classes: combinatorial bounds and enumeration |
scientific article; zbMATH DE number 6237427 |
Statements
Minimal dominating sets in graph classes: combinatorial bounds and enumeration (English)
0 references
11 December 2013
0 references
minimal dominating sets
0 references
enumeration algorithms
0 references
combinatorial bounds
0 references
graph classes
0 references
0 references
0 references
0 references
0.9852311015129088
0 references
0.8937746286392212
0 references
0.8755350112915039
0 references
0.8665003180503845
0 references
0.8586704134941101
0 references
