Exact and Heuristic Algorithms for the Domination Problem

Ernesto Parra Inza, Frank Angel Hernández Mira, José María Sigarreta Almira +1

In a simple connected graph $G=(V,E)$, a subset of vertices $S\subseteq V$ is a dominating set if any vertex $v\in V\setminus S$ is adjacent to some vertex $x$ from this subset.…