{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:19:02Z","timestamp":1770067142793,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10878-012-9592-6","type":"journal-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T17:30:53Z","timestamp":1357666253000},"page":"397-416","source":"Crossref","is-referenced-by-count":35,"title":["Improvements to MCS algorithm for the maximum clique problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Mikhail","family":"Batsyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Goldengorin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evgeny","family":"Maslov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"issue":"4","key":"9592_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade DV, Resende MGC, Werneck RF (2012) Fast local search for the maximum independent set problem. J Heuristics 18(4):525\u2013547. doi: 10.1007\/s10732-012-9196-4","journal-title":"J Heuristics"},{"issue":"4","key":"9592_CR2","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15(4):1054\u20131068","journal-title":"SIAM J Comput"},{"key":"9592_CR3","unstructured":"Bertoni A, Campadelli P, Grossi G (1997) A discrete neural algorithm for the maximum clique problem: analysis and circuit implementation. In: Proceedings of workshop on algorithm, engineering, WAE\u201997, pp 84\u201391"},{"key":"9592_CR4","unstructured":"Boginski V, Butenko S, Pardalos PM (2003) Innovations in financial and economic networks. In: Nagurney A (ed) On structural properties of the market graph. Edward Elgar Publishing, London, pp 29\u201345"},{"key":"9592_CR5","doi-asserted-by":"crossref","unstructured":"Bomze I, Budinich MPMP, Pelillo M (1999) The maximum clique problem. In: Handbook of combinatorial optimization. Kluwer Academic Publishers, Boston","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"9","key":"9592_CR6","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577. doi: 10.1145\/362342.362367","journal-title":"Commun ACM"},{"issue":"6","key":"9592_CR7","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"A Brouwer","year":"1990","unstructured":"Brouwer A, Shearer J, Sloane N, Smith W (1990) A new table of constant weight codes. IEEE Trans Inf Theory 36(6):1334\u20131380. doi: 10.1109\/18.59932","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"9592_CR8","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 WE (2006) Clique-detection models in computational biochemistry and genomics. Eur J Oper Res 173(1):1\u201317. doi: 10.1016\/j.ejor.2005.05.026","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9592_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s13173-011-0050-6","volume":"18","author":"R Carmo","year":"2012","unstructured":"Carmo R, Zuge A (2012) Branch and bound algorithms for the maximum clique problem under a unified framework. J Braz Comput Soc 18(2):137\u2013151","journal-title":"J Braz Comput Soc"},{"issue":"6","key":"9592_CR10","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 PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9(6):375\u2013382. doi: 10.1016\/0167-6377(90)90057-C","journal-title":"Oper Res Lett"},{"key":"9592_CR11","doi-asserted-by":"crossref","unstructured":"Du D, Pardalos PM (1999) Handbook of combinatorial optimization, Supplement, vol A. Springer, New York","DOI":"10.1007\/978-1-4613-0303-9"},{"key":"9592_CR12","doi-asserted-by":"crossref","unstructured":"Fahle T (2002) Simple and fast: improving a branch-and-bound algorithm for maximum clique. In: Proceedings of the 10th annual European symposium on algorithms, ESA \u201902. Springer-Verlag, London, pp 485\u2013498","DOI":"10.1007\/3-540-45749-6_44"},{"issue":"2","key":"9592_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6(2):109\u2013133. doi: 10.1007\/BF01096763","journal-title":"J Global Optim"},{"issue":"3","key":"9592_CR14","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0743-7315(92)90072-U","volume":"14","author":"N Funabiki","year":"1992","unstructured":"Funabiki N, Takefuji Y, Lee KC (1992) A neural network model for finding a near-maximum clique. J Parallel Distrib Comput 14(3):340\u2013344. doi: 10.1016\/0743-7315(92)90072-U","journal-title":"J Parallel Distrib Comput"},{"key":"9592_CR15","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness, vol 24. W. H Freeman and Co, New York"},{"key":"9592_CR16","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Norwell","DOI":"10.1007\/978-1-4615-6089-0"},{"issue":"6","key":"9592_CR17","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A Grosso","year":"2008","unstructured":"Grosso A, Locatelli M, Pullan W (2008) Simple ingredients leading to very efficient heuristics for the maximum clique problem. J Heuristics 14(6):587\u2013612. doi: 10.1007\/s10732-007-9055-x","journal-title":"J Heuristics"},{"issue":"7","key":"9592_CR18","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/j.tra.2005.11.003","volume":"40","author":"E Jenelius","year":"2006","unstructured":"Jenelius E, Petersen T, Mattsson L (2006) Importance and exposure in road network vulnerability analysis. Transport Res A Policy Pract 40(7):537\u2013560. doi: 10.1016\/j.tra.2005.11.003","journal-title":"Transport Res A Policy Pract"},{"issue":"4","key":"9592_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/rsa.3240030402","volume":"3","author":"M Jerrum","year":"1992","unstructured":"Jerrum M (1992) Large cliques elude the metropolis process. Random Struct Algorithms 3(4):347\u2013359. doi: 10.1002\/rsa.3240030402","journal-title":"Random Struct Algorithms"},{"key":"9592_CR20","unstructured":"Kopf R, Ruhe G (1987) A computational study of the weighted independent set problem for general graphs. Found Control Eng 12(4): 167\u2013180"},{"key":"9592_CR21","doi-asserted-by":"crossref","unstructured":"Li CM, Quan Z (2010a) Combining graph structure exploitation and propositional reasoning for the maximum clique problem. In: Proceedings of the 2010 22nd IEEE international conference on tools with artificial intelligence, Vol 01, ICTAI\u201910. IEEE, Arras, pp 344\u2013351","DOI":"10.1109\/ICTAI.2010.57"},{"key":"9592_CR22","doi-asserted-by":"crossref","unstructured":"Li CM, Quan Z (2010b) An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem. In: Proceedings of the twenty-fourth AAAI conference on artificial intelligence, AAAI-10. AAAI Press, Atlanta, pp 128\u2013133","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"9592_CR23","doi-asserted-by":"crossref","unstructured":"Marchiori E (2002) Genetic, iterated and multistart local search for the maximum clique problem. In: Applications of evolutionary computing. Springer-Verlag, New York, pp 112\u2013121","DOI":"10.1007\/3-540-46004-7_12"},{"key":"9592_CR24","doi-asserted-by":"crossref","unstructured":"Matula DW, Marble G, Isaacson JD (1972) Graph coloring algorithms. In: Graph theory and computing. Academic Press, New York, pp 109\u2013122","DOI":"10.1016\/B978-1-4832-3187-7.50015-5"},{"key":"9592_CR25","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski J (1955) Sur le coloriage des graphes. Colloq Math 3:161\u2013162","journal-title":"Colloq Math"},{"issue":"1","key":"9592_CR26","first-page":"159","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Int Res 25(1):159\u2013185","journal-title":"J Artif Int Res"},{"issue":"1\u20132","key":"9592_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10732-006-3750-x","volume":"12","author":"A Singh","year":"2006","unstructured":"Singh A, Gupta AK (2006) A hybrid heuristic for the maximum clique problem. J Heuristics 12(1\u20132):5\u201322. doi: 10.1007\/s10732-006-3750-x","journal-title":"J Heuristics"},{"issue":"11","key":"9592_CR28","first-page":"11","volume":"18","author":"NJA Sloane","year":"1989","unstructured":"Sloane NJA (1989) Unsolved problems in graph theory arising from the study of codes. Graph Theory Notes NY 18(11):11\u201320","journal-title":"Graph Theory Notes NY"},{"issue":"1","key":"9592_CR29","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 (2007) An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J Global Optim 37(1):95\u2013111","journal-title":"J Global Optim"},{"key":"9592_CR30","doi-asserted-by":"crossref","unstructured":"Tomita E, Seki T (2003) 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. Springer-Verlag, Berlin, Heidelberg, pp 278\u2013289","DOI":"10.1007\/3-540-45066-1_22"},{"key":"9592_CR31","doi-asserted-by":"crossref","unstructured":"Tomita E, Sutani Y, Higashi T, Takahashi S, Wakatsuki M (2010) A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the 4th international conference on algorithms and computation, WALCOM\u201910. Springer-Verlag, Berlin, Heidelberg, pp 191\u2013203","DOI":"10.1007\/978-3-642-11440-3_18"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9592-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9592-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9592-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T14:20:15Z","timestamp":1687962015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9592-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9592"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9592-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,9]]}}}