Five recent practically efficient method for solving the maximum clique problem are briefly described and compared on randomly generated graphs.