Author:
Chakraborty Dipayan,Foucaud Florent,Lehtilä Tuomo
Reference17 articles.
1. On a new class of codes for identifying vertices in graphs;Karpovsky;IEEE Transactions on Information Theory,1998
2. R. Ungrangsi, A. Trachtenberg, D. Starobinski, An implementation of indoor location detection systems based on identifying codes, in: F. A. Aagesen, C. Anutariya, V. Wuwongse (Eds.), Intelligence in Communication Systems, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 175-189.
3. The first order definability of graphs: Upper bounds for quantifier depth;Pikhurko;Discrete Applied Mathematics,2006
4. On the complexity of canonical labeling of strongly regular graphs;Babai;SIAM Journal on Computing,1980
5. Induced subsets;Bondy;Journal of Combinatorial Theory, Series B,1972