Algorithms to determine an independent dominating set of \(\mathrm{ESC}(n,k)\) (Q5360962)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6780755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms to determine an independent dominating set of \(\mathrm{ESC}(n,k)\) |
scientific article; zbMATH DE number 6780755 |
Statements
26 September 2017
0 references
dominating set
0 references
graph theory
0 references
0.7591015100479126
0 references
0.7268787026405334
0 references
0.7224369049072266
0 references
0.7212632298469543
0 references
