Researchers Analyze Combinatorial Landscapes 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

RANK_REASON This is a research paper published on arXiv detailing theoretical analysis of combinatorial problems. [lever_c_demoted from research: ic=1 ai=0.4]

Read on arXiv cs.NE (Neural & Evolutionary) →

• alphaXiv
• arXiv
• CatalyzeX
• DagsHub
• Dominating Set
• Gotit.pub
• Hugging Face
• Johanna Gasse
• ScienceCast
• Vertex Coloring

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →