{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:53:50Z","timestamp":1742957630286,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319095837"},{"type":"electronic","value":"9783319095844"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09584-4_12","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T12:00:41Z","timestamp":1406808041000},"page":"111-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Initial Sorting of Vertices in the Maximum Clique Problem Reviewed"],"prefix":"10.1007","author":[{"given":"Pablo","family":"San Segundo","sequence":"first","affiliation":[]},{"given":"Alvaro","family":"Lopez","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Batsyn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","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. Oper. Res. 173, 1\u201317 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"SIG14(TOM9)","key":"12_CR2","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":"12_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10489-008-0147-6","volume":"32","author":"P San Segundo","year":"2010","unstructured":"San Segundo, P., Rodriguez-Losada, D., Matia, F., Galan, R.: Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver. Appl. Intell. 32(3), 311\u2013329 (2010)","journal-title":"Appl. Intell."},{"issue":"5","key":"12_CR4","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.: Robust global feature based data association with a sparse bit optimized maximum clique algorithm. IEEE Trans. Rob. 29(5), 1332\u20131339 (2013)","journal-title":"IEEE Trans. Rob."},{"key":"12_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4","volume-title":"Handbook of Combinatorial Optimization, Supplement","author":"D Du","year":"1999","unstructured":"Du, D., Pardalos, P.M.: Handbook of Combinatorial Optimization, Supplement, vol. A. Springer, New York (1999)"},{"issue":"9","key":"12_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9(6), 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 191\u2013203. Springer, Heidelberg (2010)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"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.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s11590-011-0431-y","volume":"7","author":"P San Segundo","year":"2011","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 (2011)","journal-title":"Optim. Lett."},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.3390\/a5040545","volume":"5","author":"P Prosser","year":"2012","unstructured":"Prosser, P.: Exact algorithms for maximum clique: a computational study. Algorithms 5(4), 545\u2013587 (2012)","journal-title":"Algorithms"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986)","journal-title":"SIAM J. Comput."},{"key":"12_CR13","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.: Relaxed approximate coloring in exact maximum clique search. Comput. Oper. Res. 44, 185\u2013192 (2014)","journal-title":"Comput. Oper. Res."},{"key":"12_CR14","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: Proceedings of AAAI-10, pp. 128\u2013133","DOI":"10.1609\/aaai.v24i1.7536"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012)","journal-title":"J. Heuristics"},{"issue":"2","key":"12_CR16","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.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27(2), 397\u2013416 (2014)","journal-title":"J. Comb. Optim."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"12_CR18","doi-asserted-by":"crossref","unstructured":"San Segundo, P., Tapia, C.: A new implicit branching strategy for exact maximum clique. In: ICTAI, ICTAI Press, vol. 1, pp. 352\u2013357 (2010)","DOI":"10.1109\/ICTAI.2010.58"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. Assoc. Comput. Mach. 30(3), 417\u2013427 (1983)","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"San Segundo, P., Nikolaaev, A., Batsyn, A.: Infra-chromatic bound for exact maximum clique search (2014). (Manuscript submitted for publication)","DOI":"10.1016\/j.cor.2015.06.009"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09584-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:31:28Z","timestamp":1676583088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09584-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095837","9783319095844"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09584-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}