Login / Signup

On the complexity of {k}-domination and k-tuple domination in graphs.

Gabriela R. ArgiroffoValeria A. LeoniPablo Daniel Torres
Published in: Inf. Process. Lett. (2015)
Keyphrases
  • computational complexity
  • graph theoretic
  • real time
  • neural network
  • worst case
  • graph databases
  • polynomial time complexity
  • data mining
  • pattern recognition
  • pairwise
  • np complete
  • decision problems
  • graph matching