Fixed-parameter tractable algorithms for tracking set problems

DOI10.1007/978-3-319-74180-2_8zbMATH Open1497.68364OpenAlexW2783129995MaRDI QIDQ2636554FDOQ2636554

Authors: Aritra Banik, Pratibha Choudhary 

Publication date: 5 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-74180-2_8

Recommendations

• Fixed-parameter tractable algorithms for tracking shortest paths
• A polynomial sized kernel for tracking paths problem
• A polynomial sized kernel for tracking paths problem
• Tracking routes in communication networks
• Tracking paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Paths and cycles (05C38) Parameterized complexity, tractability and kernelization (68Q27)

Cited In (7)

• Tracking routes in communication networks
• Polynomial time algorithms for tracking path problems
• Improved kernels for tracking paths
• Structural parameterizations of Tracking Paths problem
• Polynomial Time Algorithms for Tracking Path Problems
• Fixed-parameter tractable algorithms for tracking shortest paths
• Polynomial kernels for tracking shortest paths

This page was built for publication: Fixed-parameter tractable algorithms for tracking set problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2636554)