Login / Signup
More results on the complexity of domination problems in graphs.
Olivier Hudry
Antoine Lobstein
Published in:
Int. J. Inf. Coding Theory (2017)
Keyphrases
</>
problems involving
np hardness
np complete
decision problems
application domains
space complexity
neural network
computational complexity
benchmark problems
tractable cases