Structural parameterizations of Tracking Paths problem
From MaRDI portal
Recommendations
Cites work
- A Practical Approach to Courcelle's Theorem
- A polynomial sized kernel for tracking paths problem
- Data reduction for graph coloring problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fixed-parameter tractable algorithms for tracking set problems
- Fixed-parameter tractable algorithms for tracking shortest paths
- Fundamentals of parameterized complexity
- Parameterized algorithms
- Parametrized complexity theory.
- Polynomial Time Algorithms for Tracking Path Problems
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- The disjoint paths problem in quadratic time
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Tracking paths
- Tracking routes in communication networks
Cited in
(4)
This page was built for publication: Structural parameterizations of Tracking Paths problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089072)