More effective randomized search heuristics for graph coloring through dynamic optimization

Jakob Bossek, Frank Neumann 0001, Pan Peng 0001, Dirk Sudholt. More effective randomized search heuristics for graph coloring through dynamic optimization. In Carlos Artemio Coello Coello, editor, GECCO '20: Genetic and Evolutionary Computation Conference, CancĂșn, Mexico, July 8-12, 2020. pages 1277-1285, ACM, 2020. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.