{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:54:46Z","timestamp":1757451286705,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["61702060"],"award-info":[{"award-number":["61702060"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11227-022-04982-7","type":"journal-article","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T11:02:59Z","timestamp":1670842979000},"page":"8026-8047","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via $$s^+$$-index"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3217-9503","authenticated-orcid":false,"given":"Mingqiang","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianqian","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,12]]},"reference":[{"issue":"3","key":"4982_CR1","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao J-K (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242(3):693\u2013709","journal-title":"Eur J Oper Res"},{"key":"4982_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2017.01.026","volume":"223","author":"S Shimizu","year":"2017","unstructured":"Shimizu S, Yamaguchi K, Saitoh T, Masuda S (2017) Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound. Discret Appl Math 223:120\u2013134","journal-title":"Discret Appl Math"},{"key":"4982_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105089","volume":"125","author":"C Blum","year":"2021","unstructured":"Blum C, Djukanovic M, Santini A, Jiang H, Raidl G (2021) Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput Oper Res 125:105089","journal-title":"Comput Oper Res"},{"issue":"1","key":"4982_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10957-016-1043-6","volume":"173","author":"MT Belachew","year":"2017","unstructured":"Belachew MT, Gillis N (2017) Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation. J Optim Theory Appl 173(1):279\u2013296","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"4982_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1186\/s13040-017-0155-3","volume":"10","author":"D Chicco","year":"2017","unstructured":"Chicco D (2017) Ten quick tips for machine learning in computational biology. BioData Mining 10(1):35","journal-title":"BioData Mining"},{"issue":"3","key":"4982_CR6","doi-asserted-by":"publisher","first-page":"327a","DOI":"10.1016\/j.bpj.2016.11.1769","volume":"112","author":"W Snead","year":"2017","unstructured":"Snead W, Hayden C, Gadok A, Rangamani P, Stachowiak J (2017) Membrane fission by protein crowding [Biophysics and Computational Biology]. Biophys J 112(3):327a","journal-title":"Biophys J"},{"key":"4982_CR7","doi-asserted-by":"crossref","first-page":"1003452","DOI":"10.1371\/journal.pcbi.1003452","volume":"10","author":"Nasir Arshan","year":"2018","unstructured":"Arshan Nasir, Mo Kim Kyung, Gustavo Caetano-Anoll\u00e9s (2018) Global patterns of protein domain gain and loss in superkingdoms. PLoS Comput Biol 10:1003452","journal-title":"PLoS Comput Biol"},{"key":"4982_CR8","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/JSYST.2015.2433294","volume":"11","author":"F Hao","year":"2017","unstructured":"Hao F, Min G, Pei Z, Park DS, Yang LT (2017) $$K$$-clique community detection in social networks based on formal concept analysis. IEEE Syst J 11:250","journal-title":"IEEE Syst J"},{"key":"4982_CR9","doi-asserted-by":"crossref","unstructured":"Wang CC, Day MY, Lin YR (2016) Toward understanding the cliques of opinion spammers with social network analysis. In: 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","DOI":"10.1109\/ASONAM.2016.7752386"},{"issue":"2","key":"4982_CR10","first-page":"325","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 Intelli Int J Artif Intell Neural Netw Complex Problem-Solving Tech 43(2):325\u2013342","journal-title":"Appl Intelli Int J Artif Intell Neural Netw Complex Problem-Solving Tech"},{"key":"4982_CR11","doi-asserted-by":"crossref","unstructured":"Yang Y, Zhong Z, Shen T, Lin Z (2018) Convolutional neural networks with alternately updated clique. In: 2018 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR)","DOI":"10.1109\/CVPR.2018.00256"},{"issue":"5","key":"4982_CR12","first-page":"1332","volume":"29","author":"PS Segundo","year":"2013","unstructured":"Segundo PS, Rodriguez-Losada D (2013) Robust global feature based data association with a sparse bit optimized maximum clique algorithm. IEEE Trans Robot Publ IEEE Robot Autom Soc 29(5):1332\u20131339","journal-title":"IEEE Trans Robot Publ IEEE Robot Autom Soc"},{"issue":"99","key":"4982_CR13","first-page":"330","volume":"PP","author":"A Elmsallati","year":"2016","unstructured":"Elmsallati A, Msalati A, Kalita J (2016) Index-based network aligner of protein-protein interaction networks. IEEE\/ACM Trans Comput Biol Bioinform PP(99):330\u2013336","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"2","key":"4982_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ejor.2019.11.035","volume":"283","author":"A Fn","year":"2020","unstructured":"Fn A, Fmp A, Bb B (2020) Detecting a most closeness-central clique in complex networks. Eur J Oper Res 283(2):461\u2013475","journal-title":"Eur J Oper Res"},{"issue":"3","key":"4982_CR15","first-page":"207","volume":"34","author":"L Babel","year":"1990","unstructured":"Babel L, Tinhofer G (1990) A branch and bound algorithm for the maximum clique problem. Z Oper Res 34(3):207\u2013217","journal-title":"Z Oper Res"},{"issue":"6","key":"4982_CR16","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 PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9(6):375\u2013382","journal-title":"Oper Res Lett"},{"key":"4982_CR17","doi-asserted-by":"crossref","unstructured":"Tomita Etsuji, Seki Tomokazu (2003) An efficient branch-and-bond algorithm for finding a maximum clique. Discret Math Theor Comput Sci. 278\u2013289","DOI":"10.1007\/3-540-45066-1_22"},{"issue":"1","key":"4982_CR18","doi-asserted-by":"publisher","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"},{"issue":"4","key":"4982_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4):251\u2013256","journal-title":"Commun ACM"},{"issue":"6","key":"4982_CR20","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1587\/transinf.E96.D.1286","volume":"E96.D","author":"E Tomita","year":"2013","unstructured":"Tomita E, Sutani Y, Higashi T, Wakatsuki M (2013) A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments. IEICE Trans Inf Syst E96.D(6):1286\u20131298","journal-title":"IEICE Trans Inf Syst"},{"key":"4982_CR21","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: WALCOM: Algorithms and Computation. 191\u2013203","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"4982_CR22","doi-asserted-by":"crossref","unstructured":"Li Chu-Min, Quan Zhe (2010) 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. 1:128\u2013133","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"4982_CR23","doi-asserted-by":"crossref","unstructured":"Li Chu-Min, Fang Zhiwen, Xu Ke (2013) Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem. In: 25th International Conference on Tools with Artificial Intelligence: 25th International Conference on Tools with Artificial Intelligence (ICTAI 2013), 4\u20136 November 2013, Washington, DC, USA, 939\u2013946","DOI":"10.1109\/ICTAI.2013.143"},{"issue":"1","key":"4982_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1287\/ijoc.2017.0770","volume":"30","author":"C-M Li","year":"2018","unstructured":"Li C-M, Fang Z, Jiang H, Xu K (2018) Incremental upper bound for the maximum clique problem. INFORMS J Comput 30(1):137\u2013153","journal-title":"INFORMS J Comput"},{"key":"4982_CR25","unstructured":"Calandriello D, Koutis I, Lazaric A, Valko M (2018) Improved large-scale graph learning through ridge spectral sparsification"},{"key":"4982_CR26","doi-asserted-by":"crossref","unstructured":"Wang L, Li CM, Zhou J, Jin B, Yin M (2019) An exact algorithm for minimum weight vertex cover problem in large graphs","DOI":"10.3390\/math7070603"},{"issue":"4","key":"4982_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.3390\/a10040113","volume":"10","author":"S Shahinpour","year":"2017","unstructured":"Shahinpour S, Shirvani S, Ertem Z, Butenko S (2017) Scale reduction techniques for computing maximum induced bicliques. Algorithms 10(4):113","journal-title":"Algorithms"},{"issue":"5","key":"4982_CR28","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1007\/s00778-020-00602-z","volume":"29","author":"L Chang","year":"2020","unstructured":"Chang L (2020) Efficient maximum clique computation and enumeration over large sparse graphs. VLDB J Int J Very Large Data Bases 29(5):999\u20131022","journal-title":"VLDB J Int J Very Large Data Bases"},{"issue":"5","key":"4982_CR29","doi-asserted-by":"publisher","first-page":"C589","DOI":"10.1137\/14100018X","volume":"37","author":"A Rossi Ryan","year":"2015","unstructured":"Rossi Ryan A, Gleich David F, Gebremedhin Assefaw H (2015) Parallel maximum clique algorithms with applications to network analysis. SIAM J Sci Comput 37(5):C589\u2013C616","journal-title":"SIAM J Sci Comput"},{"key":"4982_CR30","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cor.2015.07.013","volume":"66","author":"San Segundo Pablo","year":"2016","unstructured":"Pablo San Segundo, Alvaro Lopez, Pardalos Panos M (2016) A new exact maximum clique algorithm for large and massive sparse graphs. Comput Oper Res 66:81\u201394","journal-title":"Comput Oper Res"},{"key":"4982_CR31","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.jctb.2017.05.005","volume":"127","author":"B Barber","year":"2017","unstructured":"Barber B, K\u00fchn D, Lo A, Montgomery R, Osthus D (2017) Fractional clique decompositions of dense graphs and hypergraphs. J Combin Theory 127:148","journal-title":"J Combin Theory"},{"issue":"4","key":"4982_CR32","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1007\/s00373-015-1657-8","volume":"32","author":"Z Liang","year":"2016","unstructured":"Liang Z, Shan E, Kang L (2016) Clique-coloring claw-free graphs. Graphs Comb 32(4):1473\u20131488","journal-title":"Graphs Comb"},{"key":"4982_CR33","doi-asserted-by":"publisher","first-page":"180045","DOI":"10.1109\/ACCESS.2020.3028112","volume":"8","author":"N Mohammadi","year":"2020","unstructured":"Mohammadi N, Kadivar M (2020) NK-MaxClique and MMCQ: tow new exact branch and bound algorithms for the maximum clique problem. IEEE Access 8:180045\u2013180053","journal-title":"IEEE Access"},{"key":"4982_CR34","first-page":"868","volume":"45","author":"PS Segundo","year":"2016","unstructured":"Segundo PS, Lopez A, Batsyn M, Nikolaev A, Pardalos PM (2016) Improved initial vertex ordering for exact maximum clique search. App Intell Int J Artif Intell Neural Netw Complex Problem Solv Technol 45:868","journal-title":"App Intell Int J Artif Intell Neural Netw Complex Problem Solv Technol"},{"key":"4982_CR35","doi-asserted-by":"crossref","unstructured":"Kumlander D, Poroin A (2020) Reversed search maximum clique algorithm based on recoloring","DOI":"10.1007\/978-3-030-21803-4_46"},{"key":"4982_CR36","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"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04982-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04982-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04982-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T09:23:35Z","timestamp":1679563415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04982-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,12]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["4982"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04982-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,12,12]]},"assertion":[{"value":"26 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare no relevant relationships.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}