Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem

DOI10.1007/s00453-021-00838-3MaRDI QIDQ2240131

Jakob Bossek, Frank Neumann, Dirk Sudholt, Pan Peng

Publication date: 5 November 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.12525

zbMATH Keywords

dynamic optimization; evolutionary algorithms; running time analysis

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68W50: Evolutionary algorithms, genetic algorithms (computational aspects)

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

68W20: Randomized algorithms