Abstract

We consider parameterized complexity of the recently introduced problem of tracking paths in graphs, motivated by applications in security and wireless networks. Given an undirected and unweighted graph with a specified source s and a terminal t, the goal is to find a k-sized subset of vertices that intersect with each s-t path (or s-t shortest) path in a distinct sequence (or set).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.