Preprocessing complexity for some graph problems parameterized by structural parameters

DOI10.1016/J.PROCS.2023.08.222MaRDI QIDQ6885243zbMATH OpenFDO

Authors Manuel Lafond, Weidong Luo

Publication date 11 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

zbMATH Keywords

polynomial kernelstructural parameterMK/WK-hardpolynomial Turing kernel

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Preprocessing complexity for some graph problems parameterized by structural parameters

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