Parameterized algorithms for locating-dominating sets

Márcia R. Cappelle, Guilherme C. M. Gomes, Vinicius F. dos Santos

A locating-dominating set $D$ of a graph $G$ is a dominating set of $G$ where each vertex not in $D$ has a unique neighborhood in $D$, and the Locating-Dominating Set problem asks…