Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable.

Daniel Lokshtanov Vaishali Surianarayanan

Published in: FSTTCS (2021)

Keyphrases

dominating set
connected dominating set
fixed parameter tractable
parameterized complexity
facility location problem
bounded treewidth
computational problems
np hard
graph theoretic
np complete
global constraints
vertex set
conjunctive queries