A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs (Q3522944)
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 5321094
| 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 in Graphs |
scientific article; zbMATH DE number 5321094 |
Statements
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs (English)
0 references
4 September 2008
0 references
0.9732072353363036
0 references
0.8643158674240112
0 references
0.8523595333099365
0 references
0.8451176881790161
0 references
0.8370593190193176
0 references
