Structural Parameterizations of Tracking Paths Problem

by   Pratibha Choudhary, et al.

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 <cit.> and was found to admit a quadratic kernel when parameterized by the size of the desired solution <cit.>. 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.



There are no comments yet.


page 1

page 2

page 3

page 4


Improved Kernels for Tracking Path Problems

Given a graph G, terminal vertices s and t, and an integer k, the Tracki...

Fixed-parameter tractable algorithms for Tracking Shortest Paths

We consider the parameterized complexity of the problem of tracking shor...

Edge Deletion to Restrict the Size of an Epidemic

Given a graph G=(V,E), a set ℱ of forbidden subgraphs, we study ℱ-Free E...

On Structural Parameterizations of the Offensive Alliance Problem

The Offensive Alliance problem has been studied extensively during the l...

Multistage s-t Path: Confronting Similarity with Dissimilarity

Addressing a quest by Gupta et al. [ICALP'14], we provide a first, compr...

How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths

Given an undirected graph, G, and vertices, s and t in G, the tracking p...

Tangled Paths: A Random Graph Model from Mallows Permutations

We introduce the random graph 𝒫(n,q) which results from taking the union...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.