Parameterized complexity of domination problems using restricted modular partitions

DOI10.4230/LIPICS.MFCS.2023.61MaRDI QIDQ6647694zbMATH OpenFDO

Authors Manuel Lafond, Weidong Luo

Publication date 3 December 2024

zbMATH Keywords

parameterized algorithmsW-hardnessmodular-width\(\mathcal{G}\)-modular cardinality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Parameterized complexity of domination problems using restricted modular partitions

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