Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
scientific article; zbMATH DE number 1965256