Login / Signup

Upper bounds on the locating chromatic number of trees.

Michitaka FuruyaNaoki Matsumoto
Published in: Discret. Appl. Math. (2019)
Keyphrases
  • upper bound
  • computational complexity
  • small number
  • data sets
  • active learning
  • neural network
  • lower bound
  • color images
  • np hard
  • scheduling problem
  • fixed number