Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
Cite as
Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '19), Prague, Czech Republic, 1443–1451.Details
Publication type
Research article in proceedings (conference)
Peer reviewed
Yes
Publication status
Published
Year
2019
Conference
Genetic and Evolutionary Computation Conference (GECCO '19)
Venue
Prague, Czech Republic
Book title
Proceedings of the 21th Genetic and Evolutionary Computation Conference (GECCO)
Start page
1443
End page
1451
Publisher
ACM
Language
English
DOI