Five recent practically efficient methods for solving the maximum clique problem are briefly described and compared on randomly generated graphs. A Fortran 77 code is also given for the algorithm "Dense Clique", which is the most efficient of these methods for dense graphs.