Mohammadi, Neda; Kadivar, Mehdi A local core number based algorithm for the maximum clique problem. (English) Zbl 1488.05389 Trans. Comb. 10, No. 3, 149-163 (2021). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{N. Mohammadi} and \textit{M. Kadivar}, Trans. Comb. 10, No. 3, 149--163 (2021; Zbl 1488.05389) Full Text: DOI
Li, Chu-Min; Fang, Zhiwen; Jiang, Hua; Xu, Ke Incremental upper bound for the maximum clique problem. (English) Zbl 1528.05052 INFORMS J. Comput. 30, No. 1, 137-153 (2018). MSC: 05C69 90C35 90C57 PDFBibTeX XMLCite \textit{C.-M. Li} et al., INFORMS J. Comput. 30, No. 1, 137--153 (2018; Zbl 1528.05052) Full Text: DOI
Züge, Alexandre Prusch; Carmo, Renato On comparing algorithms for the maximum clique problem. (English) Zbl 1394.05127 Discrete Appl. Math. 247, 1-13 (2018). MSC: 05C85 05C69 05C35 05C80 PDFBibTeX XMLCite \textit{A. P. Züge} and \textit{R. Carmo}, Discrete Appl. Math. 247, 1--13 (2018; Zbl 1394.05127) Full Text: DOI
Rysz, Maciej; Pajouh, Foad Mahdavi; Krokhmal, Pavlo; Pasiliao, Eduardo L. Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights. (English) Zbl 1391.90616 Ann. Oper. Res. 262, No. 1, 89-108 (2018). MSC: 90C35 05C85 90C15 90C27 PDFBibTeX XMLCite \textit{M. Rysz} et al., Ann. Oper. Res. 262, No. 1, 89--108 (2018; Zbl 1391.90616) Full Text: DOI
Li, Chu-Min; Liu, Yanli; Jiang, Hua; Manyà, Felip; Li, Yu A new upper bound for the maximum weight clique problem. (English) Zbl 1403.90640 Eur. J. Oper. Res. 270, No. 1, 66-77 (2018). MSC: 90C35 05C69 90C27 90C57 05C85 PDFBibTeX XMLCite \textit{C.-M. Li} et al., Eur. J. Oper. Res. 270, No. 1, 66--77 (2018; Zbl 1403.90640) Full Text: DOI
Li, Chu-Min; Jiang, Hua; Manyà, Felip On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. (English) Zbl 1391.90607 Comput. Oper. Res. 84, 1-15 (2017). MSC: 90C35 05C85 90C27 90C57 PDFBibTeX XMLCite \textit{C.-M. Li} et al., Comput. Oper. Res. 84, 1--15 (2017; Zbl 1391.90607) Full Text: DOI
San Segundo, Pablo; Lopez, Alvaro; Artieda, Jorge; Pardalos, Panos M. A parallel maximum clique algorithm for large and massive sparse graphs. (English) Zbl 1370.90227 Optim. Lett. 11, No. 2, 343-358 (2017). MSC: 90C27 PDFBibTeX XMLCite \textit{P. San Segundo} et al., Optim. Lett. 11, No. 2, 343--358 (2017; Zbl 1370.90227) Full Text: DOI
Tomita, Etsuji Efficient algorithms for finding maximum and maximal cliques and their applications. (English) Zbl 1487.05254 Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 3-15 (2017). MSC: 05C85 05C69 05C30 PDFBibTeX XMLCite \textit{E. Tomita}, Lect. Notes Comput. Sci. 10167, 3--15 (2017; Zbl 1487.05254) Full Text: DOI
San Segundo, Pablo; Lopez, Alvaro; Pardalos, Panos M. A new exact maximum clique algorithm for large and massive sparse graphs. (English) Zbl 1349.90824 Comput. Oper. Res. 66, 81-94 (2016). MSC: 90C35 05C85 90C57 PDFBibTeX XMLCite \textit{P. San Segundo} et al., Comput. Oper. Res. 66, 81--94 (2016; Zbl 1349.90824) Full Text: DOI
San Segundo, Pablo; Nikolaev, Alexey; Batsyn, Mikhail Infra-chromatic bound for exact maximum clique search. (English) Zbl 1349.90825 Comput. Oper. Res. 64, 293-303 (2015). MSC: 90C35 05C85 90C27 PDFBibTeX XMLCite \textit{P. San Segundo} et al., Comput. Oper. Res. 64, 293--303 (2015; Zbl 1349.90825) Full Text: DOI
Rossi, Ryan A.; Gleich, David F.; Gebremedhin, Assefaw H. Parallel maximum clique algorithms with applications to network analysis. (English) Zbl 1323.05103 SIAM J. Sci. Comput. 37, No. 5, C589-C616 (2015). MSC: 05C69 05C82 05C85 05C90 90C27 PDFBibTeX XMLCite \textit{R. A. Rossi} et al., SIAM J. Sci. Comput. 37, No. 5, C589--C616 (2015; Zbl 1323.05103) Full Text: DOI
San Segundo, Pablo; Tapia, Cristobal Relaxed approximate coloring in exact maximum clique search. (English) Zbl 1307.90153 Comput. Oper. Res. 44, 185-192 (2014). MSC: 90C27 05C15 05C85 PDFBibTeX XMLCite \textit{P. San Segundo} and \textit{C. Tapia}, Comput. Oper. Res. 44, 185--192 (2014; Zbl 1307.90153) Full Text: DOI
Maslov, Evgeny; Batsyn, Mikhail; Pardalos, Panos Speeding up branch and bound algorithms for solving the maximum clique problem. (English) Zbl 1294.05124 J. Glob. Optim. 59, No. 1, 1-21 (2014). MSC: 05C69 05C85 05C15 90C27 90C59 90-08 PDFBibTeX XMLCite \textit{E. Maslov} et al., J. Glob. Optim. 59, No. 1, 1--21 (2014; Zbl 1294.05124) Full Text: DOI
Segundo, Pablo San; Matia, Fernando; Rodriguez-Losada, Diego; Hernando, Miguel An improved bit parallel exact maximum clique algorithm. (English) Zbl 1268.90118 Optim. Lett. 7, No. 3, 467-479 (2013). MSC: 90C35 PDFBibTeX XMLCite \textit{P. S. Segundo} et al., Optim. Lett. 7, No. 3, 467--479 (2013; Zbl 1268.90118) Full Text: DOI Link
Li, Chu Min; Zhu, Zhu; Manyà, Felip; Simon, Laurent Optimizing with minimum satisfiability. (English) Zbl 1251.68209 Artif. Intell. 190, 32-44 (2012). MSC: 68T20 90C27 90C59 PDFBibTeX XMLCite \textit{C. M. Li} et al., Artif. Intell. 190, 32--44 (2012; Zbl 1251.68209) Full Text: DOI
Segundo, Pablo San; Rodríguez-Losada, Diego; Jiménez, Agustín An exact bit-parallel algorithm for the maximum clique problem. (English) Zbl 1231.90369 Comput. Oper. Res. 38, No. 2, 571-581 (2011). MSC: 90C35 05C15 90C57 PDFBibTeX XMLCite \textit{P. S. Segundo} et al., Comput. Oper. Res. 38, No. 2, 571--581 (2011; Zbl 1231.90369) Full Text: DOI