An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924)
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: An iterated greedy algorithm for finding the minimum dominating set in graphs |
scientific article; zbMATH DE number 7701017
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterated greedy algorithm for finding the minimum dominating set in graphs |
scientific article; zbMATH DE number 7701017 |
Statements
An iterated greedy algorithm for finding the minimum dominating set in graphs (English)
0 references
26 June 2023
0 references
domination number
0 references
minimum dominating set
0 references
greedy heuristics
0 references
iterated greedy
0 references
exact algorithm
0 references
0 references
