Polynomial Turing compressions for some graph problems parameterized by modular-width

DOI10.1016/J.IC.2025.105355MaRDI QIDQ6884316zbMATH OpenFDO

Authors Weidong Luo

Publication date 15 December 2025

Published in Information and Computation (Search for Journal in Brave)

zbMATH Keywords

fixed-parameter tractabilityTuring kernelTuring compressionmodular widthstructural graph parameter

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Classical models of computation (Turing machines, etc.) (68Q04) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Polynomial Turing compressions for some graph problems parameterized by modular-width

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