@techreport{oai:ipsj.ixsq.nii.ac.jp:00212162,
 author = {Etsuji, Tomita and Jiro, Yanagisawa and Kengo, Katayama and Kazuho, Kanahara and Takahisa, Toda and Hiro, Ito and Mitsuo, Wakatsuki and Tetsuro, Nishino and Etsuji, Tomita and Jiro, Yanagisawa and Kengo, Katayama and Kazuho, Kanahara and Takahisa, Toda and Hiro, Ito and Mitsuo, Wakatsuki and Tetsuro, Nishino},
 issue = {3},
 month = {Jul},
 note = {We improve a branch-and-bound algorithm called MCT（Tomita et al., FAW 2016, LNCS 9711, pp.215-226, 2016) for finding a maximum clique. First, we devise a new efficient approximation algorithm for finding a maximum clique. Second, we employ MIS vertex ordering with an appropriate precondition. Third, we employ a combination of Re-NUMBER and Infra-chromatic bound. Finally, we devise an adaptive change of stages of the search tree. The finally improved MCT algorithm is named MCT*. It is shown that MCT* algorithm is significantly faster than MCT by extensive computational experiments. In addition, it is shown that MCT* algorithm is faster than the state-of-the-art IncMC2 algorithm（Li et al., INFORMS J. Computing, 30, pp. 137-153, 2018）for many instances., We improve a branch-and-bound algorithm called MCT（Tomita et al., FAW 2016, LNCS 9711, pp.215-226, 2016) for finding a maximum clique. First, we devise a new efficient approximation algorithm for finding a maximum clique. Second, we employ MIS vertex ordering with an appropriate precondition. Third, we employ a combination of Re-NUMBER and Infra-chromatic bound. Finally, we devise an adaptive change of stages of the search tree. The finally improved MCT algorithm is named MCT*. It is shown that MCT* algorithm is significantly faster than MCT by extensive computational experiments. In addition, it is shown that MCT* algorithm is faster than the state-of-the-art IncMC2 algorithm（Li et al., INFORMS J. Computing, 30, pp. 137-153, 2018）for many instances.},
 title = {An Improved Branch-and-Bound MCT Algorithm for Finding a Maximum Clique},
 year = {2021}
}