In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (<CitationRef CitationID="CR31">2010</CitationRef>) and MAXSAT algorithm by Li and Quan (<CitationRef CitationID="CR21">2010a</CitationRef>, <CitationRef CitationID="CR22">b</CitationRef>). We suggest a...</citationref></citationref></citationref>