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

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2023.61

zbMATH Keywords

\(\mathcal{G}\)-modular cardinalitymodular-widthparameterized algorithmsW-hardness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Red-blue unshared dominators
• (t, r)-broadcast domination in graphs
• Parameterized complexity of (d, r)-domination via modular decomposition
• Cluster editing on cographs and related classes
• Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
• Some results on the relationship of modular parameters on graphs

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)