Pratibha Choudhary

activity

20202022

most citedStructural Parameterizations of Tracking Paths Problem

1 citations · 1 across the 3 of their papers we have counts for

collaborators

6 papers

cs.DS2022

Polynomial Kernels for Tracking Shortest Paths

Václav Blažej, Pratibha Choudhary, Dušan Knop +3

Given an undirected graph $G = (V, E)$ , vertices $s, t \in V$ , and an integer $k$ , Tracking Shortest Paths requires deciding whether there exists a set of $k$ vertices $T \subseteq V$ su…

cs.DS2021

Parameterized Complexity of Minimum Membership Dominating Set

Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy +2

Given a graph $G = (V, E)$ and an integer $k$ , the Minimum Membership Dominating Set (MMDS) problem seeks to find a dominating set $S \subseteq V$ of $G$ such that for each $v \in V$ ,…

cs.DS2020★ 1 cited

Structural Parameterizations of Tracking Paths Problem

Pratibha Choudhary, Venkatesh Raman

Given a graph $G$ with source and destination vertices $s, t \in V (G)$ respectively, \textsc{Tracking Paths} asks for a minimum set of vertices $T \subseteq V (G)$ , such that the seque…

cs.DS2020

Polynomial Time Algorithms for Tracking Path Problems

Pratibha Choudhary

Given a graph $G$ , and terminal vertices $s$ and $t$ , the TRACKING PATHS problem asks to compute a minimum number of vertices to be marked as trackers, such that the sequence of tr…

cs.DS2020

Fixed-parameter tractable algorithms for Tracking Shortest Paths

Aritra Banik, Pratibha Choudhary, Venkatesh Raman +1

We consider the parameterized complexity of the problem of tracking shortest s-t paths in graphs, motivated by applications in security and wireless networks. Given an undirected a…

cs.DS2020

Improved Kernels for Tracking Path Problem

Pratibha Choudhary, Venkatesh Raman

Tracking of moving objects is crucial to security systems and networks. Given a graph $G$ , terminal vertices $s$ and $t$ , and an integer $k$ , the \textsc{Tracking Paths} problem as…