{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T02:22:21Z","timestamp":1769048541187,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T00:00:00Z","timestamp":1703548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T00:00:00Z","timestamp":1703548800000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10288-023-00559-z","type":"journal-article","created":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T08:02:10Z","timestamp":1703577730000},"page":"435-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On finding the community with maximum persistence probability"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1677-1005","authenticated-orcid":false,"given":"Alessandro","family":"Avellone","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1928-5224","authenticated-orcid":false,"given":"Stefano","family":"Benati","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5292-1723","authenticated-orcid":false,"given":"Rosanna","family":"Grassi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6987-1803","authenticated-orcid":false,"given":"Giorgio","family":"Rizzini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,26]]},"reference":[{"key":"559_CR1","first-page":"598","volume":"2286","author":"J Abello","year":"2002","unstructured":"Abello J, Resende M, Sudarsky S (2002) Massive quasi-clique detection. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2286:598\u2013612","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"559_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.cor.2019.07.003","volume":"111","author":"MT Almeida","year":"2019","unstructured":"Almeida MT, Br\u00e1s R (2019) The maximum $$l$$-triangle $$k$$-club problem: complexity, properties, and algorithms. Comput Oper Res 111:258\u2013270","journal-title":"Comput Oper Res"},{"key":"559_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1090\/conm\/588\/11705","volume":"588","author":"D Aloise","year":"2013","unstructured":"Aloise D, Caporossi G, Hansen P, Liberti L, Perron S, Ruiz M (2013) Modularity maximization in networks by variable neighborhood search. Graph Partition Graph Cluster 588:113\u2013127","journal-title":"Graph Partition Graph Cluster"},{"issue":"1","key":"559_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram B, Butenko S, Hicks I (2011) Clique relaxations in social network analysis: the maximum $$k$$-plex problem. Oper Res 59(1):133\u2013142","journal-title":"Oper Res"},{"issue":"3","key":"559_CR5","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ejor.2021.05.043","volume":"297","author":"S Benati","year":"2022","unstructured":"Benati S, Ponce D, Puerto J, Rodriguez-Chia AM (2022) A branch-and-price procedure for clustering data that are graph connected. Eur J Oper Res 297(3):817\u2013830. https:\/\/doi.org\/10.1016\/j.ejor.2021.05.043","journal-title":"Eur J Oper Res"},{"issue":"1","key":"559_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2017.02.009","volume":"261","author":"S Benati","year":"2017","unstructured":"Benati S, Puerto J, Rodr\u00edguez-Ch\u00eda A (2017) Clustering data that are graph connected. Eur J Oper Res 261(1):43\u201353","journal-title":"Eur J Oper Res"},{"issue":"10","key":"559_CR7","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):P10008","journal-title":"J Stat Mech: Theory Exp"},{"key":"559_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.socnet.2016.08.003","volume":"48","author":"F Calderoni","year":"2017","unstructured":"Calderoni F, Brunetto D, Piccardi C (2017) Communities in criminal networks: a case study. Soc Networks 48:116\u2013125. https:\/\/doi.org\/10.1016\/j.socnet.2016.08.003","journal-title":"Soc Networks"},{"issue":"3\u20134","key":"559_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"1962","unstructured":"Charnes A, Cooper WW (1962) Programming with linear fractional functionals. Naval Res Log Quart 9(3\u20134):181\u2013186","journal-title":"Naval Res Log Quart"},{"key":"559_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0493-2","volume":"8","author":"K Das","year":"2018","unstructured":"Das K, Samanta S, Pal M (2018) Study on centrality measures in social networks: a survey. Soc Netw Anal Min 8:1\u201311","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"559_CR11","first-page":"1","volume":"3","author":"F Della Rossa","year":"2013","unstructured":"Della Rossa F, Dercole F, Piccardi C (2013) Profiling core-periphery network structure by random walkers. Sci Rep 3(1):1\u20138","journal-title":"Sci Rep"},{"issue":"1","key":"559_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"559_CR13","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cie.2019.04.040","volume":"132","author":"Y Djeddi","year":"2019","unstructured":"Djeddi Y, Haddadene H, Belacel N (2019) An extension of adaptive multi-start tabu search for the maximum quasi-clique problem. Comput Ind Eng 132:280\u2013292","journal-title":"Comput Ind Eng"},{"issue":"1\u20132","key":"559_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-017-2553-9","volume":"272","author":"D D\u017eami\u0107","year":"2019","unstructured":"D\u017eami\u0107 D, Aloise D, Mladenovi\u0107 N (2019) Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization. Ann Oper Res 272(1\u20132):273\u2013287","journal-title":"Ann Oper Res"},{"key":"559_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1\u201344","journal-title":"Phys Rep"},{"issue":"12","key":"559_CR16","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"559_CR17","unstructured":"Gurobi Optimization, LLC. (2022) Gurobi optimizer reference manual. http:\/\/www.gurobi.com"},{"key":"559_CR18","doi-asserted-by":"crossref","unstructured":"Hu Y, Chen H, Zhang P, Li M, Di Z, Fan Y (2008) Comparative definition of community and corresponding identifying algorithm. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 78(2)","DOI":"10.1103\/PhysRevE.78.026121"},{"issue":"3","key":"559_CR19","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.ejor.2019.07.042","volume":"280","author":"J Kim","year":"2020","unstructured":"Kim J, Veremyev A, Boginski V, Prokopyev OA (2020) On the maximum small-world subgraph problem. Eur J Oper Res 280(3):818\u2013831","journal-title":"Eur J Oper Res"},{"key":"559_CR20","unstructured":"Krebs, V. 2004. Books about U.S. politics. Unpublished http:\/\/www.orgnet.com\/"},{"key":"559_CR21","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7:48\u201350","journal-title":"Proc Am Math Soc"},{"issue":"4","key":"559_CR22","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"issue":"2","key":"559_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"R Luce","year":"1949","unstructured":"Luce R, Perry A (1949) A method of matrix analysis of group structure. Psychometrika 14(2):95\u2013116","journal-title":"Psychometrika"},{"issue":"1","key":"559_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-012-1242-y","volume":"216","author":"F Mahdavi Pajouh","year":"2014","unstructured":"Mahdavi Pajouh F, Miao Z, Balasundaram B (2014) A branch-and-bound approach for maximum quasi-cliques. Ann Oper Res 216(1):145\u2013161","journal-title":"Ann Oper Res"},{"issue":"2","key":"559_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken R (1979) Cliques, clubs and clans. Quality Quantity 13(2):161\u2013173","journal-title":"Quality Quantity"},{"issue":"8","key":"559_CR26","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1007\/s11590-015-0971-7","volume":"12","author":"E Moradi","year":"2018","unstructured":"Moradi E, Balasundaram B (2018) Finding a maximum $$k$$-club using the $$k$$-clique formulation and canonical hypercube cuts. Optim Lett 12(8):1947\u20131957","journal-title":"Optim Lett"},{"key":"559_CR27","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo J, Veremyev A, Butenko S, Boginski V (2013) On the maximum quasiclique problem. Discret Appl Math 161:244\u2013257","journal-title":"Discret Appl Math"},{"issue":"1","key":"559_CR28","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo J, Youssef N, Butenko S (2013) On clique relaxation models in network analysis. Eur J Oper Res 226(1):9\u201318","journal-title":"Eur J Oper Res"},{"key":"559_CR29","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ins.2021.06.094","volume":"578","author":"B Peng","year":"2021","unstructured":"Peng B, Wu L, Wang Y, Wu Q (2021) Solving maximum quasi-clique problem by a hybrid artificial bee colony approach. Inf Sci 578:214\u2013235","journal-title":"Inf Sci"},{"issue":"11","key":"559_CR30","doi-asserted-by":"publisher","first-page":"e27028","DOI":"10.1371\/journal.pone.0027028","volume":"6","author":"C Piccardi","year":"2011","unstructured":"Piccardi C (2011) Finding and testing network communities by lumped Markov chains. PLoS ONE 6(11):e27028","journal-title":"PLoS ONE"},{"key":"559_CR31","doi-asserted-by":"publisher","first-page":"066119","DOI":"10.1103\/PhysRevE.85.066119","volume":"85","author":"C Piccardi","year":"2012","unstructured":"Piccardi C, Tajoli L (2012) Existence and significance of communities in the world trade web. Phys Rev E 85:066119. https:\/\/doi.org\/10.1103\/PhysRevE.85.066119","journal-title":"Phys Rev E"},{"issue":"3","key":"559_CR32","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.ejor.2018.05.071","volume":"271","author":"B Pinto","year":"2018","unstructured":"Pinto B, Ribeiro C, Rosseti I, Plastino A (2018) A biased random-key genetic algorithm for the maximum quasi-clique problem. Eur J Oper Res 271(3):849\u2013865","journal-title":"Eur J Oper Res"},{"key":"559_CR33","doi-asserted-by":"crossref","unstructured":"Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: Yolum P, G\u00fcng\u00f6r T, G\u00fcrgen F, \u00d6zturan C (eds) Computer and Information Sciences - ISCIS 2005, Berlin, Heidelberg. Springer, Berlin Heidelberg, pp 284\u2013293","DOI":"10.1007\/11569596_31"},{"issue":"9","key":"559_CR34","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi F, Castellano C, Cecconi F, Loreto V, Paris D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101(9):2658\u20132663","journal-title":"Proc Natl Acad Sci USA"},{"issue":"1","key":"559_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph theoretic generalization of the clique concept. J Math Sociol 6(1):139\u2013154","journal-title":"J Math Sociol"},{"key":"559_CR36","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s42486-019-00016-z","volume":"1","author":"W Tang","year":"2019","unstructured":"Tang W, Zhao L, Liu W, Yan B (2019) Recent advance on detecting core-periphery structure: a survey. CCF Trans Pervasive Comput Interaction 1:175\u2013189","journal-title":"CCF Trans Pervasive Comput Interaction"},{"issue":"2","key":"559_CR37","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2011.10.027","volume":"218","author":"A Veremyev","year":"2012","unstructured":"Veremyev A, Boginski V (2012) Identifying large robust network clusters via new compact formulations of maximum $$k$$-club problems. Eur J Oper Res 218(2):316\u2013326","journal-title":"Eur J Oper Res"},{"key":"559_CR38","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1093\/bioinformatics\/btl014","volume":"22","author":"H Yu","year":"2006","unstructured":"Yu H, Paccanaro A, Trifonov V, Gerstein M (2006) Predicting interactions in protein networks by completing defective cliques. Bioinformatics 22:823\u2013829","journal-title":"Bioinformatics"},{"issue":"4","key":"559_CR39","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"issue":"1","key":"559_CR40","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2020.03.019","volume":"286","author":"Q Zhou","year":"2020","unstructured":"Zhou Q, Benlic U, Wu Q (2020) An opposition-based memetic algorithm for the maximum quasi-clique problem. Eur J Oper Res 286(1):63\u201383","journal-title":"Eur J Oper Res"},{"key":"559_CR41","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cor.2017.05.005","volume":"86","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Hao JK (2017) Frequency-driven tabu search for the maximum $$s$$-plex problem. Comput Oper Res 86:65\u201378","journal-title":"Comput Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00559-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00559-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00559-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T09:06:40Z","timestamp":1732698400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00559-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,26]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00559-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,26]]},"assertion":[{"value":"15 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2023","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 have no competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial interests"}}]}}