A polynomial sized kernel for tracking paths problem

DOI10.1007/978-3-319-77404-6_8zbMath1436.68143MaRDI QIDQ5970989

Saket Saurabh, Daniel Lokshtanov, Venkatesh Raman, Aritra Banik, Pratibha Choudhary

Publication date: 12 February 2020

Published in: LATIN 2018: Theoretical Informatics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q27: Parameterized complexity, tractability and kernelization