{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T12:58:45Z","timestamp":1709384325452},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10115-021-01631-y","type":"journal-article","created":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T13:07:19Z","timestamp":1641215239000},"page":"289-324","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Determining maximum cliques for community detection in weighted sparse networks"],"prefix":"10.1007","volume":"64","author":[{"given":"Swati","family":"Goswami","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9886-1735","authenticated-orcid":false,"given":"Asit Kumar","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,3]]},"reference":[{"key":"1631_CR1","unstructured":"Abello J, Pardalos PM, Resende MGC (1998) On very large maximum clique problems. In: Proceedings of algorithms and experiments (ALEX98), pp 175\u2013183"},{"issue":"6","key":"1631_CR2","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.pmcj.2011.09.004","volume":"7","author":"N Aharony","year":"2011","unstructured":"Aharony N, Pan W, Ip C, Khayal I, Pentland A (2011) Social fMRI: investigating and shaping social mechanisms in the real world. Pervasive Mobile Comput 7(6):643\u2013659","journal-title":"Pervasive Mobile Comput"},{"issue":"2","key":"1631_CR3","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2006.06.035","volume":"181","author":"B Alidaee","year":"2007","unstructured":"Alidaee B, Glover F, Kochenberger G, Wang H (2007) Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur J Oper Res 181(2):592\u2013597","journal-title":"Eur J Oper Res"},{"key":"1631_CR4","unstructured":"Bahadur KC, Akutsu T, Tomita E, Seki T (2004) Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach. In: Proceedings of the second conference on asia-pacific bioinformatics-volume 29. Australian Computer Society, Inc., pp 191\u2013200"},{"key":"1631_CR5","volume-title":"Network science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si AL (2016) Network science. Cambridge University Press, Cambridge"},{"issue":"11","key":"1631_CR6","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"Barrat A, Barthelemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. Proc Natl Acad Sci 101(11):3747\u20133752","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"1631_CR7","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 PM (2014) Improvements to MCS algorithm for the maximum clique problem J. Combin Optim 27(2):397\u2013416","journal-title":"Combin Optim"},{"key":"1631_CR8","first-page":"1","volume-title":"Handbook of combinatorial optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem D. In: Du, Pardalos PM (eds) Handbook of combinatorial optimization. Springer, New York, pp 1\u201374"},{"issue":"9\u201310","key":"1631_CR9","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai S, Su K, Sattar A (2011) Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif Intell 175(9\u201310):1672\u20131696","journal-title":"Artif Intell"},{"issue":"19","key":"1631_CR10","doi-asserted-by":"publisher","first-page":"4177","DOI":"10.1016\/j.physa.2010.05.046","volume":"389","author":"D Chen","year":"2010","unstructured":"Chen D, Shang M, Lv Z, Fu Y (2010) Detecting overlapping communities of weighted networks via a local algorithm. Physica A: Stat Mech Appl 389(19):4177\u20134187","journal-title":"Physica A: Stat Mech Appl"},{"key":"1631_CR11","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1007\/s10878-020-00529-9","volume":"34","author":"Y Chu","year":"2020","unstructured":"Chu Y, Liu B, Cai S, Luo C, You H (2020) An efficient local search algorithm for solving maximum edge weight clique problem in large graphs. J Combin Optim 34:933\u2013954","journal-title":"J Combin Optim"},{"issue":"6","key":"1631_CR12","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"issue":"3","key":"1631_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00778-019-00540-5","volume":"28","author":"A Das","year":"2019","unstructured":"Das A, Svendsen M, Tirthapura S (2019) Incremental maintenance of maximal cliques in a dynamic graph. VLDB J 28(3):351\u2013375","journal-title":"VLDB J"},{"key":"1631_CR14","volume-title":"Graph theory {Graduate Texts in Mathematics; 173}","author":"R Diestel","year":"2000","unstructured":"Diestel R (2000) Graph theory {Graduate Texts in Mathematics; 173}. Springer, Berlin"},{"key":"1631_CR15","doi-asserted-by":"crossref","unstructured":"Eppstein D, L\u00f6ffler M, Strash D (2010) December. Listing all maximal cliques in sparse graphs in near-optimal time. In: International symposium on algorithms and computation. Springer, Berlin, pp 403\u2013414","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"1631_CR16","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume":"18","author":"D Eppstein","year":"2011","unstructured":"Eppstein D, Strash D (2011) Listing all maximal cliques in large sparse real-world graphs. Exp Algorithms 18:364\u2013375","journal-title":"Exp Algorithms"},{"issue":"1","key":"1631_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C Friden","year":"1989","unstructured":"Friden C, Hertz A, de Werra D (1989) Stabulus: a technique for finding stable sets in large graphs with tabu search. Computing 42(1):35\u201344","journal-title":"Computing"},{"key":"1631_CR18","doi-asserted-by":"crossref","unstructured":"Gong Y, Zhu Y, Duan L, Liu Q, Guan Z, Sun F, Ou W, Zhu KQ (2019) Exact-k recommendation via maximal clique optimization. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining, pp 617\u2013626","DOI":"10.1145\/3292500.3330832"},{"issue":"1","key":"1631_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13675-014-0028-1","volume":"3","author":"L Gouveia","year":"2015","unstructured":"Gouveia L, Pedro M (2015) Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. EURO J Comput Optim 3(1):1\u201330","journal-title":"EURO J Comput Optim"},{"key":"1631_CR20","doi-asserted-by":"crossref","unstructured":"Hosseinian S, Fontes DB, Butenko S, Nardelli MB, Fornari M, Curtarolo S (2017) The maximum edge weight clique problem: formulations and solution approaches. In: Optimization methods and applications. Springer, Cham, pp 217\u2013237","DOI":"10.1007\/978-3-319-68640-0_10"},{"key":"1631_CR21","first-page":"81","volume":"31","author":"P Jaccard","year":"1902","unstructured":"Jaccard P (1902) Distribution compar\u00e9e de la flore alpine dans quelques r\u00e9gions des Alpes occidentales et orientales. Bulletin de la Murithienne 31:81\u201392","journal-title":"Bulletin de la Murithienne"},{"key":"1631_CR22","doi-asserted-by":"crossref","unstructured":"Jiang H, Li CM, Manya F (2017) An exact algorithm for the maximum weight clique problem in large graphs. In: Thirty-first AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v31i1.10648"},{"key":"1631_CR23","first-page":"5","volume":"4","author":"J Konc","year":"2007","unstructured":"Konc J, Janezic D (2007) An improved branch and bound algorithm for the maximum clique problem. Proteins 4:5","journal-title":"Proteins"},{"key":"1631_CR24","first-page":"74","volume-title":"The Stanford graphbase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The Stanford graphbase: a platform for combinatorial computing. ACM Press, New York, pp 74\u201387"},{"issue":"1","key":"1631_CR25","first-page":"1","volume":"8","author":"Z Lu","year":"2018","unstructured":"Lu Z, Wahlstr\u00f6m J, Nehorai A (2018) Community detection in complex networks via clique conductance. Sci Rep 8(1):1\u201316","journal-title":"Sci Rep"},{"key":"1631_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cor.2017.04.002","volume":"85","author":"KT Malladi","year":"2017","unstructured":"Malladi KT, Mitrovic-Minic S, Punnen AP (2017) Clustered maximum weight clique problem: algorithms and empirical analysis. Comput Oper Res 85:113\u2013128","journal-title":"Comput Oper Res"},{"issue":"1","key":"1631_CR27","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed R, Gallego M, Duarte A (2010) A branch and bound algorithm for the maximum diversity problem. Eur J Oper Res 200(1):36\u201344","journal-title":"Eur J Oper Res"},{"issue":"7","key":"1631_CR28","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1016\/j.cor.2009.10.010","volume":"37","author":"P Martins","year":"2010","unstructured":"Martins P (2010) Extended and discretized formulations for the maximum clique problem. Comput Oper Res 37(7):1348\u20131358","journal-title":"Comput Oper Res"},{"issue":"1","key":"1631_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra A, Trick MA (1998) Cliques and clustering: A combinatorial approach. Oper Res Lett 22(1):1\u201312","journal-title":"Oper Res Lett"},{"key":"1631_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity: graphs, structures, and algorithms","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il J, de Mendez PO (2012) Sparsity: graphs, structures, and algorithms, vol 28. Springer, Berlin"},{"issue":"1","key":"1631_CR31","doi-asserted-by":"publisher","first-page":"016132","DOI":"10.1103\/PhysRevE.64.016132","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Phys Rev E 64(1):016132","journal-title":"Phys Rev E"},{"issue":"2","key":"1631_CR32","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"key":"1631_CR33","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104","journal-title":"Phys Rev E"},{"issue":"4","key":"1631_CR34","first-page":"424","volume":"8","author":"PR \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd PR (2001) A new algorithm for the maximum-weight clique problem. Nordic J Comput 8(4):424\u2013436","journal-title":"Nordic J Comput"},{"key":"1631_CR35","volume-title":"K-clique percolation and clustering in directed and weighted networks","author":"G Palla","year":"2005","unstructured":"Palla G, \u00c1bel D, Der\u00e9nyi I, Farkas I, Pollner P, Vicsek T (2005) K-clique percolation and clustering in directed and weighted networks. Bolayai Society Mathematical Studies, Berlin"},{"key":"1631_CR36","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814\u2013818","journal-title":"Nature"},{"issue":"3","key":"1631_CR37","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","volume":"95","author":"K Park","year":"1996","unstructured":"Park K, Lee K, Park S (1996) An extended formulation approach to the edge-weighted maximal clique problem. Eur J Oper Res 95(3):671\u2013682","journal-title":"Eur J Oper Res"},{"key":"1631_CR38","doi-asserted-by":"crossref","unstructured":"Richter S, Helmert M, Gretton C (2007) A stochastic local search approach to vertex cover. In: Annual conference on artificial intelligence. Springer, Berlin, pp 412\u2013426","DOI":"10.1007\/978-3-540-74565-5_31"},{"key":"1631_CR39","first-page":"73","volume":"34","author":"A Roberto","year":"2009","unstructured":"Roberto A, Maurizio B, Roberto C (2009) Optimal results and tight bounds for the maximum diversity problem. Found Comput Decis Sci 34:73\u201385","journal-title":"Found Comput Decis Sci"},{"key":"1631_CR40","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: AAAI, vol. 15, pp 4292\u20134293","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"1","key":"1631_CR41","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/s40537-018-0121-z","volume":"5","author":"RA Rossi","year":"2018","unstructured":"Rossi RA, Zhou R (2018) GraphZIP: a clique-based sparse graph compression method. J Big Data 5(1):10","journal-title":"J Big Data"},{"issue":"8","key":"1631_CR42","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen H, Cheng X, Cai K, Hu M-B (2009) Detect overlapping and hierarchical community structure in networks. Physica A 388(8):1706\u20131712","journal-title":"Physica A"},{"key":"1631_CR43","doi-asserted-by":"crossref","unstructured":"Shimizu S, Yamaguchi K, Masuda S (2018) A branch-and-bound based exact algorithm for the maximum edge-weight clique problem. In: International conference on computational science\/intelligence and applied informatics. Springer, Cham, pp 27\u201347","DOI":"10.1007\/978-3-319-96806-3_3"},{"issue":"1","key":"1631_CR44","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","volume":"154","author":"MM S\u00f8rensen","year":"2004","unstructured":"S\u00f8rensen MM (2004) New facets and a branch-and-cut algorithm for the weighted clique problem. Eur J Oper Res 154(1):57\u201370","journal-title":"Eur J Oper Res"},{"key":"1631_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-020-00660-9","volume":"10","author":"V Verma","year":"2020","unstructured":"Verma V, Aggarwal RK (2020) A comparative analysis of similarity measures akin to the Jaccard index in collaborative recommendations: empirical and theoretical perspective. Soc Netw Anal Min 10:1\u201316","journal-title":"Soc Netw Anal Min"},{"key":"1631_CR46","doi-asserted-by":"publisher","first-page":"25258","DOI":"10.1109\/ACCESS.2017.2769484","volume":"5","author":"X Wang","year":"2017","unstructured":"Wang X, Liu G, Li J (2017) Overlapping community detection based on structural centrality in complex networks. IEEE Access 5:25258\u201325269","journal-title":"IEEE Access"},{"issue":"6684","key":"1631_CR47","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019networks. Nature 393(6684):440","journal-title":"Nature"},{"issue":"3","key":"1631_CR48","first-page":"363","volume":"21","author":"X Wen","year":"2016","unstructured":"Wen X, Chen WN, Lin Y, Gu T, Zhang H, Li Y, Yin Y, Zhang J (2016) A maximal clique based multiobjective evolutionary algorithm for overlapping community detection. IEEE Trans Evol Comput 21(3):363\u2013377","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1631_CR49","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 JK (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242(3):693\u2013709","journal-title":"Eur J Oper Res"},{"key":"1631_CR50","doi-asserted-by":"publisher","first-page":"18374","DOI":"10.1038\/srep18374","volume":"5","author":"KR \u017dalik","year":"2015","unstructured":"\u017dalik KR (2015) Maximal neighbor similarity reveals real communities in networks. Sci Rep 5:18374","journal-title":"Sci Rep"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01631-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-021-01631-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01631-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,6]],"date-time":"2022-11-06T20:06:53Z","timestamp":1667765213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-021-01631-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,3]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1631"],"URL":"https:\/\/doi.org\/10.1007\/s10115-021-01631-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,3]]},"assertion":[{"value":"9 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}