Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3175869170 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:19, 19 March 2024
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
