Fixed-parameter tractable algorithms for tracking set problems

DOI10.1007/978-3-319-74180-2_8zbMath1497.68364OpenAlexW2783129995MaRDI QIDQ2636554

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

Mathematics Subject Classification ID

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

Related Items (7)

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

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