Author:
Cappelle Márcia R.,Coelho Erika M.M.,Coelho Hebert,Penso Lucia D.,Rautenbach Dieter
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. Minimal identifying codes in trees and planar graphs with large girth;Auger;Eur. J. Comb.,2010
2. Exact minimum density of codes identifying vertices in the square grid;Ben-Haim;SIAM J. Discrete Math.,2005
3. 1-identifying codes on trees;Bertrand;Australas. J. Comb.,2005
4. Locating-domination and identifying codes in trees;Blidia;Australas. J. Comb.,2007
5. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard;Charon;Theor. Comput. Sci.,2003