Login / Signup

Fully dynamic algorithms for permutation graph coloring.

Zoran IvkovicSarnath RamnathSivaprakasam Sunder
Published in: Int. J. Comput. Math. (1997)
Keyphrases
  • graph coloring
  • combinatorial problems
  • np complete problems
  • neural network
  • computational complexity
  • artificial neural networks
  • scheduling problem
  • distributed breakout