Login / Signup

Expected polynomial-time randomized algorithm for graph coloring problem.

Subhankar GhosalSasthi C. Ghosh
Published in: Discret. Appl. Math. (2024)
Keyphrases
  • randomized algorithm
  • greedy algorithm
  • lower bound
  • randomized algorithms
  • machine learning
  • computational complexity
  • competitive ratio
  • objective function
  • np hard
  • upper bound
  • branch and bound