Login / Signup

The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number.

Venkatesan GuruswamiAli Kemal Sinop
Published in: SODA (2011)
Keyphrases
  • bounded degree
  • small number
  • graph theoretic
  • reinforcement learning
  • graph matching
  • learning algorithm
  • probability distribution
  • logic programs
  • undirected graph