Login / Signup
On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors.
Irit Dinur
Igor Shinkar
Published in:
Electron. Colloquium Comput. Complex. (2013)
Keyphrases
</>
computational complexity
data sets
small number
maximum number
social networks
knowledge base
special case
graph matching
graph theory