Browsing by Subject "Polynomial time approximation algorithms"
Now showing items 1-1 of 1
-
Article
The d-identifying codes problem for vertex identification in graphs: Probabilistic analysis and an approximation algorithm
(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 ...