1.
Gravier S, Klasing R, Moncel J. Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. AOR [Internet]. 2008 Mar. 25 [cited 2024 Dec. 9];3(1). Available from: https://journals.lib.unb.ca/index.php/AOR/article/view/2808