Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic (Q5397695)
From MaRDI portal
scientific article; zbMATH DE number 6261121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic |
scientific article; zbMATH DE number 6261121 |
Statements
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic (English)
0 references
24 February 2014
0 references
combinatorial optimization
0 references
heuristics
0 references
exact algorithm
0 references
worst case analysis
0 references
experimentations
0 references
independent dominating set in graphs
0 references
