A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem

Enqiang Zhu, Yu Zhang, Shengzhi Wang +2

Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$.…