Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs.