{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:44:20Z","timestamp":1772757860355,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,31]],"date-time":"2011-12-31T00:00:00Z","timestamp":1325289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s11590-011-0431-y","type":"journal-article","created":{"date-parts":[[2011,12,30]],"date-time":"2011-12-30T05:14:08Z","timestamp":1325222048000},"page":"467-479","source":"Crossref","is-referenced-by-count":49,"title":["An improved bit parallel exact maximum clique algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"Pablo","family":"San Segundo","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Matia","sequence":"additional","affiliation":[]},{"given":"Diego","family":"Rodriguez-Losada","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Hernando","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,31]]},"reference":[{"key":"431_CR1","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: In: Miller, R.E., Thatcher, J.W. (eds.) Reducibility among Combinatorial Problems, pp. 85\u2013103. Plenum, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"431_CR2","first-page":"143","volume":"13","author":"D.K.C. Bahadur","year":"2006","unstructured":"Bahadur D.K.C., Akutsu T., Tomita E., Seki T., Fujijama A.: Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms. Genome Inform. 13, 143\u2013152 (2006)","journal-title":"Genome Inform."},{"key":"431_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S. Butenko","year":"2006","unstructured":"Butenko S., Wilhelm W.E.: Clique-detection models in computational biochemistry and genomics. Eur. J. Operat. Res. 173, 1\u201317 (2006)","journal-title":"Eur. J. Operat. Res."},{"issue":"SIG14(TOM9)","key":"431_CR4","first-page":"57","volume":"44","author":"K. Hotta","year":"2003","unstructured":"Hotta K., Tomita E., Takahashi H.: A view invariant human FACE detection method based on maximum cliques. Trans. IPSJ 44(SIG14(TOM9)), 57\u201370 (2003)","journal-title":"Trans. IPSJ"},{"issue":"3","key":"431_CR5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10489-008-0147-6","volume":"32","author":"P. San Segundo","year":"2010","unstructured":"San Segundo P., Rodr\u00edguez-Losada D., Mat\u00eda F., Gal\u00e1n R.: Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver. Appl. Intel. 32(3), 311\u2013329 (2010)","journal-title":"Appl. Intel."},{"key":"431_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"HandBook of Combinatorial Optimization. Supplement A","author":"I.M. Bomze","year":"1999","unstructured":"Bomze I.M., Budinich M., Pardalos P.M., Pelillo M.: HandBook of Combinatorial Optimization. Supplement A, pp. 1\u201374. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"431_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"D.R. Wood","year":"1977","unstructured":"Wood D.R.: An algorithm for finding a maximum clique in a graph. Operat. Res. Lett. 21, 211\u2013217 (1977)","journal-title":"Operat. Res. Lett."},{"key":"431_CR8","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. Operat. Res. Lett. 9, 375\u2013382 (1990)","journal-title":"Operat. Res. Lett."},{"issue":"1","key":"431_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0166-218X(01)00284-0","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120(1), 97\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"431_CR10","doi-asserted-by":"crossref","unstructured":"Tomita, E., Seki, T.: An efficient branch and bound algorithm for finding a maximum clique. In: Calude, C., Dinneen, M., Vajnovszki, V. (eds) Discrete Mathematics and Theoretical Computer Science. LNCS, vol. 2731, pp. 278\u2013289, Springer, Berlin (2003)","DOI":"10.1007\/3-540-45066-1_22"},{"key":"431_CR11","first-page":"569","volume":"58","author":"J. Konc","year":"2007","unstructured":"Konc J., Jane\u010di\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":"431_CR12","doi-asserted-by":"crossref","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 MS, Fujita S. (eds.) Proceedings of the 4th International Workshop on Algorithms and Computation. Lecture Notes in Computer Science, vol. 5942, pp. 191\u2013203. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"431_CR13","unstructured":"San Segundo, P., Rodriguez-Losada, D., Jimenez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Resour. 38(2), 571\u2013581 (2011)"},{"key":"431_CR14","volume-title":"Cliques, coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26","year":"1996","unstructured":"Johnson, D.S., Trick, M.A. (eds): Cliques, coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26. American Mathematical Society, Providence (1996)"},{"key":"431_CR15","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Chaff, S.M.: Engineering an efficient SAT solver. In: XXXVIII Proceedings of Design Automation Conference (DAC \u201901), pp. 530\u2013535. ACM, New York (2001)","DOI":"10.1145\/378239.379017"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0431-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0431-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0431-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T16:48:15Z","timestamp":1561135695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0431-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,31]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["431"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0431-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,31]]}}}