Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference20 articles.
1. Identifying and locating–dominating codes: NP-completeness results for directed graphs;Charon;IEEE Transactions on Information Theory,2002
2. Minimizing the size of an identifying or locating–dominating code in a graph is NP-hard;Charon;Theoretical Computer Science,2003
3. A greedy heuristic for the set-covering problem;Chvátal;Mathematics of Operations Research,1979
4. On identifying codes;Cohen,2001
5. Locating dominating sets in series parallel networks;Colbourn;Congressus Numerantium,1987
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献