Structural parameterizations of tracking paths problem

Given a graph G with source and destination vertices s, t ∈ V (G) respectively, Tracking Paths asks for a minimum set of vertices T ⊆ V (G), such that the sequence of vertices encountered in each simple path from s to t is unique. The problem was proven NP-hard [3] and was found to admit a quadratic kernel when parameterized by the size of the desired solution [6]. Following recent trends, for the first time, we study Tracking Paths with respect to structural parameters of the input graph, parameters that measure how far the input graph is, from an easy instance. We prove that Tracking Paths admits fixed-parameter tractable (FPT) algorithms when parameterized by the size of vertex cover, and the size of cluster vertex deletion set for the input graph.