Login / Signup
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification.
Mehdy Roayaei
Mohammadreza Razzazi
Published in:
Inf. Process. Lett. (2016)
Keyphrases
</>
dominating set
connected dominating set
facility location problem
bounded treewidth
computational complexity
dynamic programming
learning algorithm
fixed parameter tractable
np complete
database
machine learning
np hard
worst case
combinatorial optimization
facility location