Login / Signup

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs.

Irit DinurSubhash KhotWill PerkinsMuli Safra
Published in: FOCS (2010)
Keyphrases
  • computational complexity
  • database
  • directed graph
  • search engine
  • np hard
  • graph databases
  • graph representation
  • graph theoretic