Login / Signup

NP-completeness of some problems of partitioning and covering in graphs.

Bernard Péroche
Published in: Discret. Appl. Math. (1984)
Keyphrases
  • problems involving
  • optimization problems
  • np complete
  • application domains
  • real time
  • data sets
  • feature space
  • graph theory