Home Science Combinatorial Landscape Analysis for Dominating Set and...
Science

Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring

Key Points

arXiv:2606.07361v1 Announce Type: new Abstract: We analyze the two combinatorial problems of Dominating Set and Vertex Coloring regarding what kind of local optima are present for various instances. For a variety of graph classes each, we determine whether the induced landscapes are unimodal, plateau-unimodal (all optima are just one plateau), equimodal (all local optima are global) or truly multimodal. We do this for two different neighborhood operators, one based on making only a single...

arXiv:2606.07361v1 Announce Type: new Abstract: We analyze the two combinatorial problems of Dominating Set and Vertex Coloring regarding what kind of local optima are present for various instances. For a variety of graph classes each, we determine whether the induced landscapes are unimodal, plateau-unimodal (all optima are just one plateau), equimodal (all local optima are global) or truly multimodal. We do this for two different neighborhood operators, one based on making only a single change and one also allowing swaps (interchanging two parts of the solution).
Combinatorial Landscape Analysis for (ORG) Dominating Set (ORG)
Originally published by arXiv CS Read original →