Login / Signup
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width.
Lars Jaffke
O-joung Kwon
Torstein J. F. Strømme
Jan Arne Telle
Published in:
IPEC (2018)
Keyphrases
</>
decision problems
np complete
computational issues
computational complexity
optimization problems
euclidean distance
bounded treewidth
data sets
data mining
genetic algorithm
reinforcement learning
worst case
graphical models
distance metric
graph matching