Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-021-00838-3
Abstract: We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph.… read more here.
Keywords: search; time; randomized search; coloring problem ... See more keywords