An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.matcom.2022.12.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.MATCOM.2022.12.018 / rank | |||
Normal rank | |||
Latest revision as of 18:28, 30 December 2024
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
