A branch-and-reduce algorithm for finding a minimum independent dominating set (Q5403013)
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: A branch-and-reduce algorithm for finding a minimum independent dominating set |
scientific article; zbMATH DE number 6273738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-reduce algorithm for finding a minimum independent dominating set |
scientific article; zbMATH DE number 6273738 |
Statements
25 March 2014
0 references
exponential time algorithms
0 references
minimum independent dominating set
0 references
minimum maximal independent set
0 references
0.9732072353363036
0 references
0.8811593651771545
0 references
0.8619931936264038
0 references
0.8505551815032959
0 references
0.835355281829834
0 references
