Xiao, Y.; Hadjicostis, Christoforos N.; Thulasiraman, K. (2006)
Given a graph G(V, E), the identifying codes problem is to find the smallest set of vertices D ⊆ V such that no two vertices in V are adjacent to the same set of vertices in D. The identifying codes problem has been applied ...