The authors prove that (d,r)-domination is fixed-parameter tractable by modular-width plus demand, admits polynomial compressions by modular-width and iterated type partition number plus demand, and admits a polynomial kernel by neighborhood diversity plus demand.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parameterized Complexity of (d,r)-Domination via Modular Decomposition
The authors prove that (d,r)-domination is fixed-parameter tractable by modular-width plus demand, admits polynomial compressions by modular-width and iterated type partition number plus demand, and admits a polynomial kernel by neighborhood diversity plus demand.