Parameterized and approximation complexity of the detection pair problem in graphs

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]

Abstract

Abstract is missing.