Uniform kernelization complexity of hitting forbidden minors

DOI10.1007/978-3-662-47672-7_51MaRDI QIDQ6829325zbMATH OpenFDO

Authors Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh

Publication date 27 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://research.tue.nl/nl/publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9

Mathematics Subject Classification ID

Graph minors (05C83) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Uniform kernelization complexity of hitting forbidden minors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829325)