{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:33Z","timestamp":1740123813773,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072138"],"award-info":[{"award-number":["62072138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Projects of Zhejiang Lab","award":["2021KC0AB02"],"award-info":[{"award-number":["2021KC0AB02"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11280-021-00890-7","type":"journal-article","created":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T14:02:58Z","timestamp":1622901778000},"page":"535-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On flexible cohesive subgraph mining"],"prefix":"10.1007","volume":"25","author":[{"given":"Dandan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9475-8944","authenticated-orcid":false,"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,5]]},"reference":[{"key":"890_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection[C]. In: Latin American Symposium on Theoretical Informatics, pp 598\u2013612. Springer, Berlin Heidelberg (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"issue":"13-14","key":"890_CR2","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1016\/j.dam.2012.04.005","volume":"160","author":"G Ausiello","year":"2012","unstructured":"Ausiello, G., Boria, N., Giannakos, A., et al.: Online maximum k-coverage[J]. Discret. Appl. Math. 160(13-14), 1901\u20131913 (2012)","journal-title":"Discret. Appl. Math."},{"key":"890_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An O (m) algorithm for cores decomposition of networks[J]. arXiv:0310049 (2003)"},{"key":"890_CR4","doi-asserted-by":"crossref","unstructured":"Boden, B., G\u00fcnnemann, S., Hoffmann, H., et al: Mining coherent subgraphs in multi-layer graphs with edge labels[C]. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1258\u20131266 (2012)","DOI":"10.1145\/2339530.2339726"},{"key":"890_CR5","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., et al: Efficiently computing k-edge connected components via graph decomposition[C]. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"890_CR6","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis[J]. National security agency technical report. 16, 3\u201329 (2008)"},{"key":"890_CR7","doi-asserted-by":"crossref","unstructured":"Feng, C., Wang, H., Tu, X.M., et al: A note on generalized inverses of distribution function and quantile transformation[J] (2012)","DOI":"10.4236\/am.2012.312A289"},{"key":"890_CR8","doi-asserted-by":"crossref","unstructured":"Gionis, A., Tsourakakis, C.E.: Dense subgraph discovery: Kdd 2015 tutorial[C]. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 2313\u20132314 (2015)","DOI":"10.1145\/2783258.2789987"},{"key":"890_CR9","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.future.2020.02.023","volume":"107","author":"F Hao","year":"2020","unstructured":"Hao, F., Pei, Z., Yang, L.T.: Diversified top-k maximal clique detection in social internet of things[J]. Futur. Gener. Comput. Syst. 107, 408\u2013417 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"1","key":"890_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of NP-completeness (michael r. garey and david s. johnson)[J]. SIAM Rev. 24(1), 90 (1982)","journal-title":"SIAM Rev."},{"key":"890_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-1-4419-6045-0_10","volume-title":"A Survey of Algorithms for Dense Subgraph discovery[M]. Managing and Mining Graph Data","author":"VE Lee","year":"2010","unstructured":"Lee, V.E., Ruan, N., Jin, R., et al: A Survey of Algorithms for Dense Subgraph discovery[M]. Managing and Mining Graph Data, pp 303\u2013336. Springer, Boston, MA (2010)"},{"issue":"2","key":"890_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure[J]. Psychometrika 14(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"issue":"2","key":"890_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H Matsuda","year":"1999","unstructured":"Matsuda, H., Ishihara, T., Hashimoto, A.: Classifying molecular sequences using a linkage graph with their pairwise similarities[J]. Theor. Comput. Sci. 210(2), 305\u2013325 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"890_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken, R.J.: Cliques, clubs and clans[J]. Qual. Quant. 13(2), 161\u2013173 (1979)","journal-title":"Qual. Quant."},{"key":"890_CR15","first-page":"119","volume":"50","author":"J Pardalos","year":"1999","unstructured":"Pardalos, J., Resende, M.: On maximum clique problems in very large graphs[J]. DIMACS Ser. 50, 119\u2013130 (1999)","journal-title":"DIMACS Ser."},{"key":"890_CR16","doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Seshadhri, C., Pinar, A, et al: Finding the hierarchy of dense subgraphs using nucleus decompositions[C]. In: Proceedings of the 24th International Conference on World Wide Web, pp 927\u2013937 (2015)","DOI":"10.1145\/2736277.2741640"},{"issue":"3","key":"890_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree[J]. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"6684","key":"890_CR18","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks[J]. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"890_CR19","doi-asserted-by":"publisher","first-page":"104867","DOI":"10.1016\/j.cor.2019.104867","volume":"116","author":"J Wu","year":"2020","unstructured":"Wu, J., Li, C.M., Jiang, L., et al: Local search for diversified Top-k clique search problem[J]. Comput. Oper. Res. 116, 104867 (2020)","journal-title":"Comput. Oper. Res."},{"key":"890_CR20","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yan, D., Wu, H., et al: Diversified temporal subgraph pattern mining[C]. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1965\u20131974 (2016)","DOI":"10.1145\/2939672.2939848"},{"issue":"2","key":"890_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., et al: Diversified top-k clique search[J]. VLDB J. 25(2), 171\u2013196 (2016)","journal-title":"VLDB J."},{"key":"890_CR22","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: Diversified coherent core search on multi-layer graphs[C]\/\/2018. In: IEEE 34th International Conference on Data Engineering (ICDE), pp 701\u2013712. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00069"},{"key":"890_CR23","doi-asserted-by":"crossref","unstructured":"Zuckerman, D: Linear degree extractors and the inapproximability of max clique and chromatic number[C]. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00890-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00890-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00890-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T11:16:07Z","timestamp":1646133367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00890-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,5]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["890"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00890-7","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2021,6,5]]},"assertion":[{"value":"1 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}