On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors.

Irit Dinur Igor Shinkar

Published in: APPROX-RANDOM (2010)

Keyphrases

small number
random graphs
maximum number
genetic algorithm
computational complexity
structured data
constraint satisfaction
connected components
graph representation
constant factor