Florent Foucaud, Ralf Klasing. Parameterized and approximation complexity of the detection pair problem in graphs. J. Graph Algorithms Appl., 21(6):1039-1056, 2017. [doi]
@article{FoucaudK17,
title = {Parameterized and approximation complexity of the detection pair problem in graphs},
author = {Florent Foucaud and Ralf Klasing},
year = {2017},
doi = {10.7155/jgaa.00449},
url = {https://doi.org/10.7155/jgaa.00449},
researchr = {https://researchr.org/publication/FoucaudK17},
cites = {0},
citedby = {0},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {1039-1056},
}