Author:
Bertrand Nathalie,Charon Irène,Hudry Olivier,Lobstein Antoine
Subject
Discrete Mathematics and Combinatorics
Reference11 articles.
1. N. Bertrand, I. Charon, O. Hudry, A. Lobstein, 1-identifying codes on trees, Austral. J. Combin. (in press)
2. The minimum density of an identifying code in the king lattice;Charon;Discrete Math.,2004
3. Identifying codes with small radius in some infinite regular graphs;Charon;Electron. J. Combin.,2002
4. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard;Charon;Theoret. Comput. Sci.,2003
5. Locating dominating sets in series parallel networks;Colbourn;Congr. Numer.,1987
Cited by
70 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献