Login / Signup

The computational complexity of dominating set problems for instances with bounded minors of constraint matrices.

Dmitriy S. MalyshevDmitry V. Gribanov
Published in: Discret. Optim. (2018)
Keyphrases
  • computational complexity
  • dominating set
  • np complete
  • neural network
  • decision problems
  • soft constraints
  • high computational complexity
  • evolutionary algorithm
  • mathematical model
  • computationally expensive