Author:
Milanič Martin,Tomescu Alexandru I.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference32 articles.
1. Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets;Cantone,2001
2. A linear algorithm for minimum 1-identifying codes in oriented trees;Charon;Discrete Appl. Math.,2006
3. Identifying and locating-dominating codes: NP-completeness results for directed graphs;Charon;IEEE Trans. Inform. Theory,2002
4. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard;Charon;Theoret. Comput. Sci.,2003
5. G. Cohen, I. Honkala, A. Lobstein, G. Zémor, On identifying codes, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Proc. DIMACS Workshop on Codes and Association Schemes, vol. 56, 2001, pp. 97–109.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献