{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:36:24Z","timestamp":1775302584884,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,12,10]],"date-time":"2014-12-10T00:00:00Z","timestamp":1418169600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s11590-014-0837-4","type":"journal-article","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T05:24:46Z","timestamp":1418102686000},"page":"949-960","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A parallel branch and bound algorithm for the maximum labelled clique problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Ciaran","family":"McCreesh","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,10]]},"reference":[{"key":"837_CR1","doi-asserted-by":"crossref","unstructured":"Carrabs, F., Cerulli, R., Dell\u2019Olmo, P.: A mathematical programming approach for the maximum labeled clique problem. In: Procedia\u2014Social and Behavioral Sciences 108(0), 69\u201378 (2014). doi: 10.1016\/j.sbspro.2013.12.821 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S187704281305461X","DOI":"10.1016\/j.sbspro.2013.12.821"},{"issue":"9","key":"837_CR2","doi-asserted-by":"crossref","first-page":"2217","DOI":"10.1021\/ci4002525","volume":"53","author":"M Depolli","year":"2013","unstructured":"Depolli, M., Konc, J., Rozman, K., Trobec, R., Jane\u017ei\u010d, D.: Exact parallel maximum clique algorithm for general and protein graphs. J. Chem. Inf. Model. 53(9), 2217\u20132228 (2013). doi: 10.1021\/ci4002525","journal-title":"J. Chem. Inf. Model."},{"issue":"6","key":"837_CR3","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","volume":"27","author":"TH Lai","year":"1984","unstructured":"Lai, T.H., Sahni, S.: Anomalies in parallel branch-and-bound algorithms. Commun. ACM 27(6), 594\u2013602 (1984)","journal-title":"Commun. ACM"},{"key":"837_CR4","unstructured":"Li, C.M., Zhu, Z., Many\u00e0, F., Simon, L.: Minimum satisfiability and its applications. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, Volume One, IJCAI\u201911, pp. 605\u2013610. AAAI Press, Palo Alto (2011). doi: 10.5591\/978-1-57735-516-8\/IJCAI11-108"},{"key":"837_CR5","doi-asserted-by":"crossref","unstructured":"McCreesh, C., Prosser, P.: Multi-threading a state-of-the-art maximum clique algorithm. Algorithms 6(4), 618\u2013635 (2013). doi: 10.3390\/a6040618 . http:\/\/www.mdpi.com\/1999-4893\/6\/4\/618","DOI":"10.3390\/a6040618"},{"key":"837_CR6","doi-asserted-by":"crossref","unstructured":"McCreesh, C., Prosser, P.: Reducing the branching in a branch and bound algorithm for the maximum clique problem. In: Principles and Practice of Constraint Programming, 20th International Conference, CP 2014. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-10428-7_40"},{"key":"837_CR7","unstructured":"McCreesh, C., Prosser, P.: The shape of the search tree for the maximum clique problem, and the implications for parallel branch and bound. ACM Trans. Parallel Comput. (2014) (To appear; preprint as CoRR abs\/1401.5921)"},{"key":"837_CR8","doi-asserted-by":"crossref","unstructured":"Prosser, P.: Exact algorithms for maximum clique: a computational study. Algorithms 5(4), 545\u2013587 (2012). doi: 10.3390\/a5040545 . http:\/\/www.mdpi.com\/1999-4893\/5\/4\/545","DOI":"10.3390\/a5040545"},{"key":"837_CR9","doi-asserted-by":"crossref","unstructured":"San Segundo, P., Lopez, A., Batsyn, M.: Initial sorting of vertices in the maximum clique problem reviewed. In: P.M. Pardalos, M.G. Resende, C. Vogiatzis, J.L. Walteros (eds.) Learning and Intelligent Optimization, Lecture Notes in Computer Science, pp. 111\u2013120. Springer International Publishing (2014). doi: 10.1007\/978-3-319-09584-4_12","DOI":"10.1007\/978-3-319-09584-4_12"},{"issue":"3","key":"837_CR10","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s11590-011-0431-y","volume":"7","author":"P San Segundo","year":"2013","unstructured":"San Segundo, P., Matia, F., Rodriguez-Losada, D., Hernando, M.: An improved bit parallel exact maximum clique algorithm. Optim. Lett. 7(3), 467\u2013479 (2013). doi: 10.1007\/s11590-011-0431-y","journal-title":"Optim. Lett."},{"issue":"2","key":"837_CR11","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P San Segundo","year":"2011","unstructured":"San Segundo, P., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011). doi: 10.1016\/j.cor.2010.07.019","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"837_CR12","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(1), 95\u2013111 (2007)","journal-title":"J. Glob. Optim."},{"key":"837_CR13","doi-asserted-by":"crossref","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS\u201903, pp. 278\u2013289. Springer, Berlin (2003). http:\/\/dl.acm.org\/citation.cfm?id=1783712.1783736","DOI":"10.1007\/3-540-45066-1_22"},{"key":"837_CR14","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, M., Fujita, S. (eds.) WALCOM: 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","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"837_CR15","unstructured":"Trienekens, H.W.: Parallel branch and bound algorithms. Ph.D. thesis, Erasmus University Rotterdam (1990)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0837-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0837-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0837-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T19:15:37Z","timestamp":1553627737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0837-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,10]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["837"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0837-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,10]]}}}