{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T19:33:20Z","timestamp":1777577600439,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11590-023-02054-0","type":"journal-article","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T13:02:36Z","timestamp":1695646956000},"page":"1491-1510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A maximal-clique-based set-covering approach to overlapping community detection"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1465-6233","authenticated-orcid":false,"given":"Michael J.","family":"Brusco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas","family":"Steinley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashley L.","family":"Watts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,25]]},"reference":[{"key":"2054_CR1","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1017\/S0140525X10000920","volume":"33","author":"AO Cramer","year":"2010","unstructured":"Cramer, A.O., Waldorp, L.J., van der Maas, H.L., Borsboom, D.: Complex realities require complex theories: refining and extending the network approach to mental disorders. Behav. Brain Sci. 33, 178\u2013193 (2010)","journal-title":"Behav. Brain Sci."},{"key":"2054_CR2","doi-asserted-by":"publisher","unstructured":"Brusco, M. J., Steinley, D., Watts, A.L.: A comparison of logistic regression methods for Ising model estimation. Behav. Res. Meth. https:\/\/doi.org\/10.3758\/s13428-022-01976-4 (2022)","DOI":"10.3758\/s13428-022-01976-4"},{"key":"2054_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/srep05918","volume":"4","author":"CD van Borkulo","year":"2014","unstructured":"van Borkulo, C.D., Borsboom, D., Epskamp, S., Blanken, T.F., Boschloo, L., Schoevers, R.A., Waldorp, L.J.: A new method for constructing networks from binary data. Sci. Rep. 4, 1\u20138 (2014)","journal-title":"Sci. Rep."},{"key":"2054_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1111\/bmsp.12173","volume":"73","author":"DR Williams","year":"2020","unstructured":"Williams, D.R., Rast, P.: Back to the basics: rethinking partial correlation network methodology. Brit. J. Math. Stat. Psych. 73, 187\u2013212 (2020)","journal-title":"Brit. J. Math. Stat. Psych."},{"key":"2054_CR5","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"JH Friedman","year":"2008","unstructured":"Friedman, J.H., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical lasso. Biostatistics 9, 432\u2013441 (2008)","journal-title":"Biostatistics"},{"key":"2054_CR6","doi-asserted-by":"publisher","unstructured":"Brusco, M. J., Steinley, D., Watts, A. L.: On maximization of the modularity index in network psychometrics. Behav. Res. Meth. https:\/\/doi.org\/10.3758\/s13428-022-01975-5 (2022)","DOI":"10.3758\/s13428-022-01975-5"},{"key":"2054_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1037\/met0000167","volume":"23","author":"S Epskamp","year":"2018","unstructured":"Epskamp, S., Fried, E.I.: A tutorial on regularized partial correlation networks. Psych. Meth. 23, 617\u2013634 (2018)","journal-title":"Psych. Meth."},{"key":"2054_CR8","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"2054_CR9","doi-asserted-by":"publisher","first-page":"046112","DOI":"10.1103\/PhysRevE.82.046112","volume":"82","author":"D Aloise","year":"2010","unstructured":"Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Perron, S., Liberti, L.: Column generation algorithms for exact modularity maximization in networks. Phys. Rev. E 82, 046112 (2010)","journal-title":"Phys. Rev. E"},{"key":"2054_CR10","doi-asserted-by":"publisher","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008, 10008. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"2054_CR11","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2054_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11590-014-0754-6","volume":"9","author":"A Miyauchi","year":"2015","unstructured":"Miyauchi, A., Sukegawa, N.: Redundant constraints in the standard formulation for the clique partitioning problem. Optim. Lett. 9, 199\u2013207 (2015)","journal-title":"Optim. Lett."},{"key":"2054_CR13","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1007\/s11590-014-0818-7","volume":"9","author":"A Miyauchi","year":"2015","unstructured":"Miyauchi, A., Sukegawa, N.: Maximizing Barber\u2019s bipartite modularity is also hard. Optim. Lett. 9, 897\u2013913 (2015)","journal-title":"Optim. Lett."},{"key":"2054_CR14","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Fast algorithm for detecting com. Munity structure in networks. Phys. Rev. E 69, 066133 (2004)","journal-title":"Phys. Rev. E"},{"key":"2054_CR15","doi-asserted-by":"publisher","first-page":"056131","DOI":"10.1103\/PhysRevE.70.056131","volume":"70","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Analysis of weighted networks. Phys. Rev. E 70, 056131 (2004)","journal-title":"Phys. Rev. E"},{"key":"2054_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(91)90001-K","volume":"22","author":"J Bhasker","year":"1991","unstructured":"Bhasker, J., Samad, T.: The clique partitioning problem. Comp. Math. Appl. 22, 1\u201311 (1991)","journal-title":"Comp. Math. Appl."},{"key":"2054_CR17","first-page":"191","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Alg. Appl. 10, 191\u2013218 (2006)","journal-title":"J. Graph Alg. Appl."},{"key":"2054_CR18","doi-asserted-by":"publisher","unstructured":"Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74, 016110. https:\/\/doi.org\/10.1103\/PhysRevE.74.016110 (2006)","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"2054_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.3389\/fninf.2016.00045","volume":"10","author":"KM Gates","year":"2016","unstructured":"Gates, K.M., Henry, T., Steinley, D., Fair, D.A.: A Monte Carlo evaluation of weighted community detection algorithms. Front. Neuroinformatics 10, 45 (2016). https:\/\/doi.org\/10.3389\/fninf.2016.00045","journal-title":"Front. Neuroinformatics"},{"key":"2054_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1080\/00273171.2017.1391682","volume":"53","author":"M Hoffman","year":"2018","unstructured":"Hoffman, M., Steinley, D., Gates, K.M., Prinstein, M.J., Brusco, M.J.: Detecting clusters\/communities in social networks. Mult. Behav. Res. 53, 57\u201373 (2018)","journal-title":"Mult. Behav. Res."},{"key":"2054_CR21","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.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814\u2013818 (2005)","journal-title":"Nature"},{"key":"2054_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/1367-2630\/9\/6\/180","volume":"9","author":"IJ Farkas","year":"2007","unstructured":"Farkas, I.J., \u00c1bel, D., Palla, G., Vicsek, T.: Weighted network modules. New J. Phys. 9, 1\u201318 (2007)","journal-title":"New J. Phys."},{"key":"2054_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"2054_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1111\/j.1435-5597.1972.tb01521.x","volume":"28","author":"C Toregas","year":"1972","unstructured":"Toregas, C., ReVelle, C.S.: Optimal location under time or distance constraints. Papers Reg. Sci. Assoc. 28, 133\u2013144 (1972)","journal-title":"Papers Reg. Sci. Assoc."},{"key":"2054_CR25","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C Toregas","year":"1971","unstructured":"Toregas, C., Swain, R., ReVelle, C.S., Bergman, L.: The location of emergency service facilities. Oper. Res. 19, 1363\u20131373 (1971)","journal-title":"Oper. Res."},{"key":"2054_CR26","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1093\/bioinformatics\/btl039","volume":"22","author":"B Adamcsek","year":"2006","unstructured":"Adamcsek, B., Palla, G., Farkas, I.J., Der\u00e9nyi, I., Vicsek, T.: CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22, 1021\u20131023 (2006)","journal-title":"Bioinformatics"},{"key":"2054_CR27","doi-asserted-by":"publisher","first-page":"205","DOI":"10.2307\/2785673","volume":"20","author":"F Harary","year":"1957","unstructured":"Harary, F., Ross, I.C.: A procedure for clique detection using the group matrix. Sociometry 20, 205\u2013215 (1957)","journal-title":"Sociometry"},{"key":"2054_CR28","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 4, pp. 1\u201374. Kluwer, Boston (1999)"},{"key":"2054_CR29","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Glob. Opt. 4, 301\u2013328 (1994)","journal-title":"J. Glob. Opt."},{"key":"2054_CR30","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11590-014-0782-2","volume":"9","author":"C Vogiatzis","year":"2015","unstructured":"Vogiatzis, C., Veremyev, A., Pasiliao, E.L., Pardalos, P.M.: An integer programming approach for finding the most and the least central cliques. Optim. Lett. 9, 615\u2013633 (2015)","journal-title":"Optim. Lett."},{"key":"2054_CR31","unstructured":"Wildman, J. Bron-Kerbosch maximal clique finding algorithm (https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/30413-bron-kerbosch-maximal-clique-finding-algorithm), MATLAB Central File Exchange. Retrieved April 10, (2023)."},{"key":"2054_CR32","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. Comm. ACM 16, 575\u2013577 (1973)","journal-title":"Comm. ACM"},{"key":"2054_CR33","unstructured":"Nguyen, A.-D.: k-clique algorithm, (https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/34202-k-clique-algorithm), MATLAB central file exchange. Retrieved November 22, (2022)"},{"key":"2054_CR34","unstructured":"MATLAB.: version 9.8.0 (R2020a). Natick, Massachusetts: The MathWorks Inc. (2020)"},{"key":"2054_CR35","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80, 016118 (2009)","journal-title":"Phys. Rev. E"},{"key":"2054_CR36","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1207\/s15327906mbr2302_6","volume":"23","author":"LM Collins","year":"1988","unstructured":"Collins, L.M., Dent, C.W.: Omega: a general formulation of the Rand index of cluster recovery suitable for non-disjoint solutions. Mult. Behav. Res. 23, 231\u2013242 (1988)","journal-title":"Mult. Behav. Res."},{"key":"2054_CR37","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 191\u2013212 (1985)","journal-title":"J. Classif."},{"key":"2054_CR38","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1001\/jamapsychiatry.2015.0584","volume":"72","author":"BF Grant","year":"2015","unstructured":"Grant, B.F., Goldstein, R.B., Saha, T.D., Chou, S.P., Jung, J., Zhang, H., Pickering, R.P., Ruan, W.J., Smith, S.M., Huang, B., Hasin, D.S.: Epidemiology of DSM-5 alcohol use disorder: results from the national epidemiologic survey on alcohol and related conditions III. JAMA Psych. 72, 757\u2013766 (2015)","journal-title":"JAMA Psych."},{"key":"2054_CR39","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. Inter. J. Complex Sys. 1695, 1\u20139 (2006)","journal-title":"Inter. J. Complex Sys."},{"key":"2054_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v048.i04","volume":"48","author":"S Epskamp","year":"2012","unstructured":"Epskamp, S., Cramer, A.O., Waldorp, L.J., Schmittmann, V.D., Borsboom, D.: qgraph: network visualizations of relationships in psychometric data. J. Stat. Soft. 48, 1\u201318 (2012)","journal-title":"J. Stat. Soft."},{"key":"2054_CR41","unstructured":"Lange, J.: R package \u201cCliquePercolation\u201d: clique percolation for networks. (https:\/\/cran.r-project.org\/web\/packages\/CliquePercolation\/CliquePercolation.pdf). Retrieved 4\/12\/2023 (2013)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02054-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02054-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02054-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T08:16:04Z","timestamp":1719044164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02054-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,25]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2054"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02054-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,25]]},"assertion":[{"value":"30 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}