![](/img/cover-not-exists.png)
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
Irène Charon, Olivier Hudry, Antoine LobsteinVolume:
290
Year:
2003
Language:
english
Pages:
12
DOI:
10.1016/s0304-3975(02)00536-4
File:
PDF, 144 KB
english, 2003