Fixed-parameter tractable algorithms for Tracking Shortest Paths

18 Aug 2020 Banik Aritra Choudhary Pratibha Raman Venkatesh Saurabh Saket

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 and unweighted graph with a source s and a destination t, Tracking Shortest Paths asks if there exists a k-sized subset of vertices (referred to as tracking set) that intersects each shortest s-t path in a distinct set of vertices... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS

Datasets


  Add Datasets introduced or used in this paper