{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:04:19Z","timestamp":1771459459799,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319398167","type":"print"},{"value":"9783319398174","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39817-4_21","type":"book-chapter","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T09:15:09Z","timestamp":1464254109000},"page":"215-226","source":"Crossref","is-referenced-by-count":17,"title":["A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique"],"prefix":"10.1007","author":[{"given":"Etsuji","family":"Tomita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohei","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuro","family":"Hatta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuki","family":"Nagao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsuo","family":"Wakatsuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10878-012-9592-6","volume":"27","author":"M Batsyn","year":"2014","unstructured":"Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27, 397\u2013416 (2014)","journal-title":"J. Comb. Optim."},{"key":"21_CR2","unstructured":"http:\/\/www.nlsde.buaa.edu.cn\/~kexu\/benchmarks\/graph-benchmarks.htm"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization, Supplement","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Supplement, vol. A, pp. 1\u201374. Kluwer Academic Publishers, Boston (1999)"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"key":"21_CR5","unstructured":"Fujii, T., Tomita, E.: On efficient algorithms for finding a maximum clique, Technical report of IECE, AL81-113, 25\u201334 (1982)"},{"key":"21_CR6","series-title":"DIMACS Series in DMTCS","volume-title":"Cliques, Coloring, and Satisfiability","year":"1996","unstructured":"Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability. DIMACS Series in DMTCS, vol. 26. American Mathematical Society, Boston (1996)"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2005.05.010","volume":"95","author":"K Katayama","year":"2005","unstructured":"Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95, 503\u2013511 (2005)","journal-title":"Inf. Process. Lett."},{"key":"21_CR8","unstructured":"Kohata, Y., Nishijima, T., Tomita, E., Fujihashi, C., Takahashi, H.: Efficient algorithms for finding a maximum clique, Technical report of IEICE, COMP89-113, 1\u20138 (1990)"},{"key":"21_CR9","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc, J., Jane\u017ei\u010d, D.: An improved branch and bound algorithm for the maximum clique problem. MATCH Commun. Math. Comput. Chem. 58, 569\u2013590 (2007)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Li, C.M., Quan, Z.: An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem. In: AAAI Conference on AI, pp. 128\u2013133 (2010)","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Li, C.M., Quan, Z.: Combining graph structure exploitation and propositional reasoning for the maximum clique problem. In: Proceedings of the IEEE ICTAI, pp. 344\u2013351 (2010)","DOI":"10.1109\/ICTAI.2010.57"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-013-0075-9","volume":"59","author":"E Maslov","year":"2014","unstructured":"Maslov, E., Batsyn, M., Pardalos, P.M.: Speeding up branch and bound algorithms for solving the maximum clique problem. J. Glob. Optim. 59, 1\u201321 (2014)","journal-title":"J. Glob. Optim."},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.cor.2015.06.009","volume":"64","author":"PS Segundo","year":"2015","unstructured":"Segundo, P.S., Nikolaev, A., Batsyn, M.: Infra-chromatic bound for exact maximum clique search. Comput. Oper. Res. 64, 293\u2013303 (2015)","journal-title":"Comput. Oper. Res."},{"key":"21_CR14","unstructured":"Sutani, Y., Higashi, T., Tomita, E., Takahashi, S., Nakatani, H.: A faster branch-and-bound algorithm for finding a maximum clique, Technical report of IPSJ, 2006-AL-108, 79\u201386 (2006)"},{"key":"21_CR15","unstructured":"Tomita, E., Kohata, Y., Takahashi, H.: A simple algorithm for finding a maximum clique, Technical report of the Univ. of Electro-Commun., UEC-TR-C5(1) (1988)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 278\u2013289. Springer, Heidelberg (2003)"},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37, 95\u2013111 (2007)","journal-title":"J. Glob. Optim."},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume-title":"WALCOM: Algorithms and Computation","author":"E Tomita","year":"2010","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 191\u2013203. Springer, Heidelberg (2010)"},{"key":"21_CR19","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1587\/transinf.E96.D.1286","volume":"E96\u2013D","author":"E Tomita","year":"2013","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments. IEICE Trans. Inf. Syst. E96\u2013D, 1286\u20131298 (2013)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"21_CR20","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242, 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the STOC 2006, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39817-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T12:49:35Z","timestamp":1692362975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39817-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319398167","9783319398174"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39817-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}