Structural parameterizations of Tracking Paths problem

DOI10.1016/j.tcs.2022.09.009OpenAlexW3081273719MaRDI QIDQ2089072

Pratibha Choudhary, Venkatesh Raman

Publication date: 6 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.09806

zbMATH Keywords

split graphsvertex coverundirected graphsstructural parameterizationedge clique covercluster vertex deletion setTracking Paths

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Constant factor approximation for tracking paths and fault tolerant feedback vertex set

Cites Work

• Fundamentals of parameterized complexity
• Data reduction for graph coloring problems
• The disjoint paths problem in quadratic time
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
• Fixed-parameter tractable algorithms for tracking shortest paths
• Parametrized complexity theory.
• Fixed-parameter tractable algorithms for tracking set problems
• Polynomial Time Algorithms for Tracking Path Problems
• A Practical Approach to Courcelle's Theorem
• Tracking Paths
• Parameterized Algorithms
• Tracking routes in communication networks
• A polynomial sized kernel for tracking paths problem

This page was built for publication: Structural parameterizations of Tracking Paths problem