Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems

DOI10.1145/3293466zbMath1454.68101MaRDI QIDQ4629983

Meirav Zehavi, Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Tien-Nam Le, Steéphan Thomassé

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3293466

zbMATH Keywords

parameterized complexity; kernelization; implicit 3-hitting set; implicit 3-set packing

Mathematics Subject Classification ID

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

68Q27: Parameterized complexity, tractability and kernelization