Login / Signup

Approximate the chromatic number of a graph using maximal independent sets.

Angélica Guzmán PonceJosé Raymundo Marcial-RomeroGuillermo De Ita LunaJosé Antonio Hernández Servín
Published in: CONIELECOMP (2016)
Keyphrases
  • maximum number
  • small number
  • image processing
  • neural network
  • information retrieval
  • graph mining
  • fixed number
  • disjoint sets
  • polynomial time complexity
  • anti monotonic