Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Researchers have analyzed the combinatorial problems of Dominating Set and Vertex Coloring to understand the types of local optima present in various problem instances. The study determines whether the induced landscapes are unimodal, plateau-unimodal, equimodal, or truly multimodal for different graph classes. This analysis considers two neighborhood operators: one involving single changes and another allowing swaps. AI