Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. Auger, D.: Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Combin. 31(5), 1372–1384 (2010)
2. Auger, D., Charon, I., Hudry, O., Lobstein, A.: Complexity results for identifying codes in planar graphs. Int. T. Oper. Res. 17(6), 691–710 (2010)
3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. Springer (1999)
4. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
5. Berger-Wolf, T.Y., Laifenfeld, M., Trachtenberg, A.: Identifying codes and the set cover problem. In: Proc. 44th Allerton Conf. on Comm. Contr. and Comput. (2006)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献