Fast solution of NP-hard coloring problems on large random graphs

Andrea Bedini Jesper Lykke Jacobsen

Published in: CoRR (2010)

Keyphrases

np hard
approximate solutions
optimal solution
random graphs
np complete
np hardness
computational complexity
special case
scheduling problem
integer programming
exact solution
lower bound
linear programming