Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Researchers have analyzed the combinatorial landscape of Dominating Set and Vertex Coloring problems. They determined the presence of local optima for various graph classes and neighborhood operators. The study classifies landscapes as unimodal, plateau-unimodal, equimodal, or truly multimodal. AI