{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:02:20Z","timestamp":1771704140199,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T00:00:00Z","timestamp":1464048000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T00:00:00Z","timestamp":1464048000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000166","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["DPI 2010-21247-C02-01"],"award-info":[{"award-number":["DPI 2010-21247-C02-01"]}],"id":[{"id":"10.13039\/100000166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000166","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["DPI 2014-53525-C3-1-R"],"award-info":[{"award-number":["DPI 2014-53525-C3-1-R"]}],"id":[{"id":"10.13039\/100000166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["14-41-00039"],"award-info":[{"award-number":["14-41-00039"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10489-016-0796-9","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T12:29:05Z","timestamp":1464092945000},"page":"868-880","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Improved initial vertex ordering for exact maximum clique search"],"prefix":"10.1007","volume":"45","author":[{"given":"Pablo San","family":"Segundo","sequence":"first","affiliation":[]},{"given":"Alvaro","family":"Lopez","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Batsyn","sequence":"additional","affiliation":[]},{"given":"Alexey","family":"Nikolaev","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"796_CR1","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1093\/bioinformatics\/btq100","volume":"26","author":"J Konc","year":"2010","unstructured":"Konc J, Janezic D (2010) ProBiS algorithm for detection of structurally similar protein binding sites by local structural alignment. Bioinformatics 26:1160\u20131168","journal-title":"Bioinformatics"},{"key":"796_CR2","doi-asserted-by":"publisher","first-page":"S5","DOI":"10.1186\/1471-2105-13-S10-S5","volume":"13","author":"J Eblen","year":"2012","unstructured":"Eblen J, Phillips C, Rogers G, Langston M (2012) The maximum clique enumeration problem: algorithms, applications, and implementations. BMC Bioinforma 13:S5","journal-title":"BMC Bioinforma"},{"key":"796_CR3","doi-asserted-by":"crossref","unstructured":"Butenko S, Chaovalitwongse W, Pardalos P (eds) (2009) Clustering challenges in biological networks. World Scientific, Singapore","DOI":"10.1142\/6602"},{"issue":"2","key":"796_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10489-015-0646-1","volume":"43","author":"P San Segundo","year":"2015","unstructured":"San Segundo P, Artieda J (2015) A novel clique formulation for the visual feature matching problem. Appl Intell 43(2):325\u2013342","journal-title":"Appl Intell"},{"issue":"5","key":"796_CR5","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1109\/TRO.2013.2264869","volume":"29","author":"P San Segundo","year":"2013","unstructured":"San Segundo P, Rodriguez-Losada D (2013) Robust global feature based data association with a sparse bit optimized maximum clique algorithm. IEEE Trans Robot 29(5):1332\u20131339","journal-title":"IEEE Trans Robot"},{"key":"796_CR6","doi-asserted-by":"publisher","first-page":"1:97","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd P (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120:1:97\u2013207","journal-title":"Discrete Appl Math"},{"key":"796_CR7","doi-asserted-by":"crossref","unstructured":"Fahle T (2002) Simple and fast: Improving a -and-bound algorithm for maximum clique. In: Proceedings ESA-2002, pp 485\u2013498","DOI":"10.1007\/3-540-45749-6_44"},{"key":"796_CR8","unstructured":"Tomita E, Seki T (2003) 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"},{"key":"796_CR9","first-page":"191","volume":"5942","author":"E Tomita","year":"2010","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. LNCS 5942:191\u2013203","journal-title":"LNCS"},{"key":"796_CR10","doi-asserted-by":"publisher","first-page":"2:571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P San Segundo","year":"2011","unstructured":"San Segundo P, Rodriguez-Losada D, Jimenez A (2011) An exact bit-parallel algorithm for the maximum clique problem. Comput Oper Res 38:2:571\u2013581","journal-title":"Comput Oper Res"},{"key":"796_CR11","doi-asserted-by":"publisher","first-page":"3: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 (2013) An improved bit parallel exact maximum clique algorithm. Optim Lett 7:3:467\u2013479","journal-title":"Optim Lett"},{"key":"796_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.cor.2013.10.018","volume":"44","author":"P San Segundo","year":"2014","unstructured":"San Segundo P, Tapia C (2014) Relaxed approximate coloring in exact maximum clique search. Comput Oper Res 44:185\u2013192","journal-title":"Comput Oper Res"},{"key":"796_CR13","unstructured":"Li C-M, Quan Z (2010) An Efficient Branch-and-Bound Algorithm based on MaxSAT for the Maximum Clique Problem. In: Proceedings AAAI, pp 128\u2013133"},{"key":"796_CR14","unstructured":"Li C-M, Quan Z (2010) Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem. In: Proceedings ICTAI, pp 344\u2013351"},{"key":"796_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.cor.2015.06.009","volume":"64","author":"P San Segundo","year":"2015","unstructured":"San Segundo P, Nikolaev A, Batsyn M (2015) Infra-chromatic bound for exact maximum clique search. Comput Oper Res 64:293\u2013303","journal-title":"Comput Oper Res"},{"key":"796_CR16","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc J, Jane\u010di\u010d D (2007) An improved branch and bound algorithm for the maximum clique problem. MATCH Commun Math Comput Chem 58:569\u2013590","journal-title":"MATCH Commun Math Comput Chem"},{"key":"796_CR17","doi-asserted-by":"publisher","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 (2014) Improvements to MCS algorithm for the maximum clique problem. J Comb Optim 27:397\u2013416","journal-title":"J Comb Optim"},{"key":"796_CR18","unstructured":"Li C-M, Fang Z, Xu K (2013) Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem. In: Proceedings ICTAI, pp 939\u2013946"},{"key":"796_CR19","doi-asserted-by":"publisher","first-page":"9: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","journal-title":"Commun ACM"},{"key":"796_CR20","doi-asserted-by":"publisher","first-page":"4:1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas E, Yu C (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15:4:1054\u20131068","journal-title":"SIAM J Comput"},{"key":"796_CR21","doi-asserted-by":"publisher","first-page":"4:545","DOI":"10.3390\/a5040545","volume":"5","author":"P Prosser","year":"2012","unstructured":"Prosser P (2012) Exact algorithms for maximum clique: a computational study. Algorithms 5:4:545\u2013587","journal-title":"Algorithms"},{"key":"796_CR22","doi-asserted-by":"publisher","first-page":"6:375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos P (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:6:375\u2013382","journal-title":"Oper Res Lett"},{"key":"796_CR23","unstructured":"Personal communication with researchers Ciaran McCreesh and Patrick Prosser"},{"key":"796_CR24","first-page":"1:85","volume":"10","author":"D Welsh","year":"1976","unstructured":"Welsh D, Powell M (1976) An upper bound for the chromatic number of a graph and its application to timetabling problem. Comput J 10:1:85\u201386","journal-title":"Comput J"},{"key":"796_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0012-365X(89)90212-4","volume":"74","author":"M Syslo","year":"1989","unstructured":"Syslo M (1989) Sequential coloring versus Welsh-Powell bound. Discret Math 74:241\u2013243","journal-title":"Discret Math"},{"issue":"6","key":"796_CR26","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F Leighton","year":"1979","unstructured":"Leighton F (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bur Stand 84 (6):489\u2013506","journal-title":"J Res Natl Bur Stand"},{"key":"796_CR27","doi-asserted-by":"publisher","first-page":"3:693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao J (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242:3:693\u2013709","journal-title":"Eur J Oper Res"},{"key":"796_CR28","doi-asserted-by":"publisher","first-page":"4:525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"D Andrade","year":"2012","unstructured":"Andrade D, Resende MG, Werneck R (2012) Fast local search for the maximum independent set problem. J Heuristics 18:4:525\u2013547","journal-title":"J Heuristics"}],"updated-by":[{"DOI":"10.1007\/s10489-016-0862-3","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T00:00:00Z","timestamp":1479427200000}}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-016-0796-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0796-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0796-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0796-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T12:54:36Z","timestamp":1589720076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-016-0796-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,24]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["796"],"URL":"https:\/\/doi.org\/10.1007\/s10489-016-0796-9","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10489-016-0862-3","asserted-by":"object"}]},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,24]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}