Improved Kernels for Tracking Path Problem

21 Aug 2020 Choudhary Pratibha Raman Venkatesh

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 asks whether there exists at most $k$ vertices, which if marked as trackers, would ensure that the sequence of trackers encountered in each s-t path is unique... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS