Two algorithms for determining a minimum independent dominating set (Q3319782)
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 3850483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for determining a minimum independent dominating set |
scientific article; zbMATH DE number 3850483 |
Statements
Two algorithms for determining a minimum independent dominating set (English)
0 references
1984
0 references
minimum independent dominating set
0 references
combinatorial optimaization
0 references
NP-hard
0 references
backtracking algorithm
0 references
dynamic programming algorithm
0 references
0.8451176881790161
0 references
0.8419758677482605
0 references
0.8379288911819458
0 references
0.8340100646018982
0 references
0.8327127695083618
0 references
