@inbook{b19e229bfeab47a38cd9ef2c595fa9d9,
title = "Locating-Domination and Identification",
abstract = "Locating-domination and identification are two particular, related, types of domination: a set C of vertices in a graph G = (V, E) is a locating-dominating code if it is dominating and any two vertices of V ∖ C are dominated by distinct sets of codewords; C is an identifying code if it is dominating and any two vertices of V are dominated by distinct sets of codewords. This chapter presents a survey of the major results on locating-domination and on identification.",
author = "Antoine Lobstein and Olivier Hudry and Ir{\`e}ne Charon",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-51117-3\_8",
language = "English",
series = "Developments in Mathematics",
publisher = "Springer",
pages = "251--299",
booktitle = "Developments in Mathematics",
}