{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:14:30Z","timestamp":1769926470859,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T00:00:00Z","timestamp":1446163200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ARC DECRA","award":["DE140100999"],"award-info":[{"award-number":["DE140100999"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC61232006"],"award-info":[{"award-number":["NSFC61232006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC61021004"],"award-info":[{"award-number":["NSFC61021004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARC DP","award":["DP120104168"],"award-info":[{"award-number":["DP120104168"]}]},{"name":"ARC DP","award":["DP140103578"],"award-info":[{"award-number":["DP140103578"]}]},{"name":"ARC DECRA","award":["DE150100563"],"award-info":[{"award-number":["DE150100563"]}]},{"name":"ARC DECRA","award":["DE120102144"],"award-info":[{"award-number":["DE120102144"]}]},{"name":"ARC DP","award":["DP120104168"],"award-info":[{"award-number":["DP120104168"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00778-015-0408-z","type":"journal-article","created":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T11:55:39Z","timestamp":1446206139000},"page":"171-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":87,"title":["Diversified top-k clique search"],"prefix":"10.1007","volume":"25","author":[{"given":"Long","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,30]]},"reference":[{"issue":"9","key":"408_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J., et al.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"408_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S.: Diversifying search results. In: Proceedings of WSDM\u201909, pp. 5\u201314 (2009)","DOI":"10.1145\/1498759.1498766"},{"issue":"1","key":"408_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, E.A.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1\u20136 (1973)","journal-title":"SIAM J. Comput."},{"key":"408_CR4","doi-asserted-by":"crossref","unstructured":"Angel, A., Koudas, N.: Efficient diversity-aware search. In: Proceedings of SIGMOD\u201911, pp. 781\u2013792 (2011)","DOI":"10.1145\/1989323.1989405"},{"issue":"13\u201314","key":"408_CR5","doi-asserted-by":"crossref","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., Lucarelli, G., Paschos, V.T.: Online maximum k-coverage. Discrete Appl. Math. 160(13\u201314), 1901\u20131913 (2012)","journal-title":"Discrete Appl. Math."},{"key":"408_CR6","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of KDD\u201914, pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"408_CR7","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR. cs.DS\/0310049 (2003)"},{"issue":"3","key":"408_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0378-8733(79)90014-5","volume":"2","author":"HR Bernard","year":"1979","unstructured":"Bernard, H.R., Killworth, P.D., Sailer, L.: Informant accuracy in social network data IV: a comparison of clique-level structure in behavioral and cognitive network data. Soc. Netw. 2(3), 191\u2013218 (1979)","journal-title":"Soc. Netw."},{"key":"408_CR9","unstructured":"Berry, N., Ko, T., Moy, T., Smrcka, J., Turnley, J., Wu, B.: Emergent clique formation in terrorist recruitment. In: Workshop on Agent Organizations: Theory and Practice (2004)"},{"key":"408_CR10","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: Proceedings of PODS\u201912, pp. 155\u2013166 (2012)","DOI":"10.1145\/2213556.2213580"},{"issue":"9","key":"408_CR11","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"issue":"6","key":"408_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Operat. Res. Lett. 9(6), 375\u2013382 (1990)","journal-title":"Operat. Res. Lett."},{"issue":"1","key":"408_CR13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s00453-012-9632-8","volume":"66","author":"L Chang","year":"2013","unstructured":"Chang, L., Yu, J.X., Qin, L.: Fast maximal cliques enumeration in sparse graphs. Algorithmica 66(1), 173\u2013186 (2013)","journal-title":"Algorithmica"},{"key":"408_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: Proceedings of ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"4","key":"408_CR15","doi-asserted-by":"crossref","first-page":"21:1","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng, J., Ke, Y., Fu, A.W.-C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks. ACM Trans. Database Syst. 36(4), 21:1\u201321:34 (2011)","journal-title":"ACM Trans. Database Syst."},{"key":"408_CR16","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: Proceedings of KDD\u201912, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"key":"408_CR17","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Tomkins, A.: Max-cover in map-reduce. In: Proceedings of WWW\u201910, pp. 231\u2013240 (2010)","DOI":"10.1145\/1772690.1772715"},{"key":"408_CR18","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks and its applications. In: Proceedings of SIGKDD, pp. 672\u2013680 (2011)","DOI":"10.1145\/2020408.2020513"},{"key":"408_CR19","doi-asserted-by":"crossref","unstructured":"Demidova, E., Fankhauser, P., Zhou, X., Nejdl, W.: DivQ: diversification for keyword search over structured databases. In: Proceedings of SIGIR\u201910, pp. 331\u2013338 (2010)","DOI":"10.1145\/1835449.1835506"},{"issue":"2","key":"408_CR20","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/2602136","volume":"39","author":"T Deng","year":"2014","unstructured":"Deng, T., Fan, W.: On the complexity of query result diversification. ACM Trans. Database Syst. 39(2), 15:1\u201315:46 (2014)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"408_CR21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1860702.1860709","volume":"39","author":"M Drosou","year":"2010","unstructured":"Drosou, M., Pitoura, E.: Search result diversification. SIGMOD Rec. 39(1), 41\u201347 (2010)","journal-title":"SIGMOD Rec."},{"key":"408_CR22","first-page":"403","volume":"1","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D., Loffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. ISAAC 1, 403\u2013414 (2010)","journal-title":"ISAAC"},{"key":"408_CR23","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Proceedings of SEA\u201911, pp. 364\u2013375 (2011)","DOI":"10.1007\/978-3-642-20662-7_31"},{"issue":"13","key":"408_CR24","first-page":"1510","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6(13), 1510\u20131521 (2013)","journal-title":"PVLDB"},{"issue":"4","key":"408_CR25","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"408_CR26","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., San Francisco (1979)"},{"issue":"4","key":"408_CR27","first-page":"27:1","volume":"39","author":"X Hu","year":"2014","unstructured":"Hu, X., Tao, Y., Chung, C.: I\/O-efficient algorithms on triangle listing and counting. ACM Trans. Database Syst. 39(4), 27:1\u201327:30 (2014)","journal-title":"ACM Trans. Database Syst."},{"key":"408_CR28","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"408_CR29","first-page":"5","volume":"4","author":"J Konc","year":"2007","unstructured":"Konc, J., Janezic, D.: An improved branch and bound algorithm for the maximum clique problem. Proteins 4, 5 (2007)","journal-title":"Proteins"},{"key":"408_CR30","unstructured":"Lee, C., Reid, F., McDaid, A., Hurley, N.: Detecting highly overlapping community structure by greedy clique expansion. In: Workshop on Social Network Mining and Analysis (2010)"},{"key":"408_CR31","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: The k most representative skyline operator. In: Proceedings of ICDE, pp. 86\u201395 (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"key":"408_CR32","doi-asserted-by":"crossref","unstructured":"Minack, E., Siberski, W., Nejdl, W.: Incremental diversification for very large sets: a streaming-based approach. In: Proceedings of SIGIR\u201911, pp. 585\u2013594 (2011)","DOI":"10.1145\/2009916.2009996"},{"issue":"1","key":"408_CR33","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PR \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1), 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"408_CR34","first-page":"1124","volume":"5","author":"L Qin","year":"2012","unstructured":"Qin, L., Yu, J.X., Chang, L.: Diversifying top-k results. PVLDB 5(11), 1124\u20131135 (2012)","journal-title":"PVLDB"},{"key":"408_CR35","unstructured":"Robson, J.: Finding a maximum independent set in time $$O(2^{n\/4})$$ O ( 2 n \/ 4 ) . In: Technical report, 1251-01, LaBRI, Universit\u00e9 de Bordeaux I (2001)"},{"key":"408_CR36","doi-asserted-by":"crossref","unstructured":"Saha, B., Getoor, L.: On maximum coverage in the streaming model & application to multi-topic blog-watch. In: Proceedings of SDM\u201909, pp. 697\u2013708 (2009)","DOI":"10.1137\/1.9781611972795.60"},{"issue":"4","key":"408_CR37","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt, M.C., Samatova, N.F., Thomas, K., Park, B.-H.: A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distrib. Comput. 69(4), 417\u2013428 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"408_CR38","doi-asserted-by":"crossref","first-page":"81","DOI":"10.12988\/ams.2014.310601","volume":"8","author":"M Suyudi","year":"2014","unstructured":"Suyudi, M., Mohd, I.B., Mamat, M., Sopiyan, S., Supriatna, A.K.: Solution of maximum clique problem by using branch and bound method. Appl. Math. Sci. 8(2), 81\u201390 (2014)","journal-title":"Appl. Math. Sci."},{"issue":"1","key":"408_CR39","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Global Optim. 37(1), 95\u2013111 (2007)","journal-title":"J. Global Optim."},{"issue":"1","key":"408_CR40","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"408_CR41","doi-asserted-by":"crossref","unstructured":"Vieira, M.R., Razente, H.L., Barioni, M.C.N., Hadjieleftheriou, M., Srivastava, D., Traina, Jr., C., Tsotras, V.J.: On query result diversification. In: Proceedings of ICDE\u201911 (2011)","DOI":"10.1109\/ICDE.2011.5767846"},{"issue":"9","key":"408_CR42","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"PVLDB"},{"key":"408_CR43","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J., Fu, A.W.-C.: Redundancy-aware maximal cliques. In: Proceedings of KDD\u201913, pp. 122\u2013130 (2013)","DOI":"10.1145\/2487575.2487689"},{"issue":"1","key":"408_CR44","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1), 85\u201386 (1967)","journal-title":"Comput. J."},{"key":"408_CR45","doi-asserted-by":"crossref","unstructured":"Xiang, J., Guo, C., Aboulnaga, A.: Scalable maximum clique computation using mapreduce. In Proceedings of ICDE\u201913, pp. 74\u201385 (2013)","DOI":"10.1109\/ICDE.2013.6544815"},{"key":"408_CR46","doi-asserted-by":"crossref","unstructured":"Xu, Y., Cheng, J., Fu, A.W.-C., Bu, Y.: Distributed maximal clique computation. In: Proceedings of BigData\u201914, pp. 160\u2013167 (2014)","DOI":"10.1109\/BigData.Congress.2014.31"},{"key":"408_CR47","doi-asserted-by":"crossref","unstructured":"Yu, H., Yuan, D.: Set coverage problems in a one-pass data stream. In: Proceedings of SDM\u201913, pp. 758\u2013766 (2013)","DOI":"10.1137\/1.9781611972832.84"},{"key":"408_CR48","doi-asserted-by":"crossref","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. In: Proceedings of ICDE\u201915, pp. 387\u2013398 (2015)","DOI":"10.1109\/ICDE.2015.7113300"},{"key":"408_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Qin, L., Yu, J.X.: Contract & expand: I\/O efficient sccs computing. In: Proceedings of ICDE, pp. 208\u2013219 (2014)","DOI":"10.1109\/ICDE.2014.6816652"},{"key":"408_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Yu, J.X., Qin, L., Chang, L., Lin, X.: I\/O efficient: computing sccs in massive graphs. In: Proceedings of SIGMOD, pp. 181\u2013192 (2013)","DOI":"10.1145\/2463676.2463703"},{"key":"408_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Yu, J.X., Qin, L., Shang, Z.: Divide & conquer: I\/O efficient depth-first search. In: Proceedings of SIGMOD, pp. 445\u2013458 (2015)","DOI":"10.1145\/2723372.2723740"},{"issue":"6","key":"408_CR52","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.jplph.2010.09.010","volume":"168","author":"X Zheng","year":"2011","unstructured":"Zheng, X., Liu, T., Yang, Z., Wang, J.: Large cliques in Arabidopsis gene coexpression network and motif discovery. J. Plant Physiol. 168(6), 611\u2013618 (2011)","journal-title":"J. Plant Physiol."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0408-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0408-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0408-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T07:23:43Z","timestamp":1748676223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0408-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,30]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["408"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0408-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,30]]}}}