A polynomial sized kernel for tracking paths problem

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

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

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

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Tracking routes in communication networks

This page was built for publication: A polynomial sized kernel for tracking paths problem