The paper proves that Vector Domination is W[1]-hard when parameterized by neighborhood diversity, and gives fixed-parameter algorithms for Distance Vector Domination under modular-width and treewidth parameters.
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
REJECT 1representative citing papers
citing papers explorer
-
Distance Vector Domination
The paper proves that Vector Domination is W[1]-hard when parameterized by neighborhood diversity, and gives fixed-parameter algorithms for Distance Vector Domination under modular-width and treewidth parameters.