PulseAugur
EN
LIVE 23:30:58

Researchers analyze local optima in graph coloring and dominating set problems

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

RANK_REASON The cluster contains an academic paper detailing a theoretical analysis of combinatorial problems. [lever_c_demoted from research: ic=1 ai=0.4]

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

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

COVERAGE [1]

  1. arXiv cs.NE (Neural & Evolutionary) TIER_1 English(EN) · Maxim Stanko ·

    Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring

    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 j…