On the enumeration and counting of minimal dominating sets in interval and permutation graphs (Q2872098)
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 enumeration and counting of minimal dominating sets in interval and permutation graphs |
scientific article; zbMATH DE number 6245143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the enumeration and counting of minimal dominating sets in interval and permutation graphs |
scientific article; zbMATH DE number 6245143 |
Statements
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs (English)
0 references
14 January 2014
0 references
0.8586400747299194
0 references
0.8454090356826782
0 references
0.8450220227241516
0 references
0.8252525329589844
0 references
0.8140736222267151
0 references
