Turing kernelization for finding long paths in graph classes excluding a topological minor

DOI10.1007/s00453-019-00614-4zbMath1430.68219arXiv1707.01797MaRDI QIDQ2272596

Marcin Pilipczuk, Marcin Wrochna, Bart M. P. Jansen

Publication date: 10 September 2019

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-path; Turing kernelization; graph minors decomposition

Mathematics Subject Classification ID

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

05C83: Graph minors

68Q27: Parameterized complexity, tractability and kernelization