FOUCAUD, Florent; KLASING, Ralf. Parameterized and approximation complexity of the detection pair problem in graphs. Journal of Graph Algorithms and Applications, [S. l.], v. 21, n. 6, p. 1039–1056, 2017. DOI: 10.7155/jgaa.00449. Disponível em: http://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper449. Acesso em: 6 jul. 2024.