Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem |
scientific article |
Statements
Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (English)
0 references
5 November 2021
0 references
evolutionary algorithms
0 references
dynamic optimization
0 references
running time analysis
0 references
0 references
0 references
0 references
0 references
