Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
Crossref DOI link: https://doi.org/10.1007/s00453-021-00838-3
Published Online: 2021-06-18
Published Print: 2021-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bossek, Jakob http://orcid.org/0000-0002-4121-4668
Neumann, Frank
Peng, Pan
Sudholt, Dirk
Funding for this research was provided by:
Westfälische Wilhelms-Universität Münster
Text and Data Mining valid from 2021-06-18
Version of Record valid from 2021-06-18
Article History
Received: 1 December 2019
Accepted: 21 May 2021
First Online: 18 June 2021