2 citations · 3 across the 5 of their papers we have counts for
Showing cs.NEShow all
2 papers · 1 filter
cs.NE2021
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
Jakob Bossek, Frank Neumann, Pan Peng +1
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…
cs.NE2020★ 2 cited
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization
Jakob Bossek, Frank Neumann, Pan Peng +1
Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that…