{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T09:53:58Z","timestamp":1779011638585,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s00778-020-00649-y","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T03:29:23Z","timestamp":1619062163000},"page":"713-738","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["I\/O efficient k-truss community search in massive graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Yuli","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8397-1309","authenticated-orcid":false,"given":"Xin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,22]]},"reference":[{"issue":"11","key":"649_CR1","first-page":"1298","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. PVLDB 10(11), 1298\u20131309 (2017)","journal-title":"PVLDB"},{"key":"649_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: WWW, pp. 595\u2013601 (2004)","DOI":"10.1145\/988672.988752"},{"key":"649_CR3","doi-asserted-by":"crossref","unstructured":"Chang, L., Lin, X., Qin, L., Yu, J.X., Zhang, W.: Index-based optimal algorithms for computing steiner components with maximum connectivity. In: SIGMOD, pp. 459\u2013474 (2015)","DOI":"10.1145\/2723372.2746486"},{"key":"649_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"1","key":"649_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"649_CR6","volume-title":"Trusses: Cohesive Subgraphs for Social Network Analysis","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. Tech. rep, National security agency technical report (2008)"},{"key":"649_CR7","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: SIGMOD, pp. 277\u2013288 (2013)","DOI":"10.1145\/2463676.2463722"},{"key":"649_CR8","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"649_CR9","doi-asserted-by":"crossref","unstructured":"Ebadian, S., Huang, X.: Fast algorithm for k-truss discovery on public-private graphs. In: IJCAI, pp. 2258\u20132264 (2019)","DOI":"10.24963\/ijcai.2019\/313"},{"key":"649_CR10","doi-asserted-by":"crossref","unstructured":"Edachery, J., Sen, A., Brandenburg, F.J.: Graph clustering using distance-k cliques. In: International Symposium on Graph Drawing, pp. 98\u2013106 (1999)","DOI":"10.1007\/3-540-46648-7_10"},{"issue":"6","key":"649_CR11","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00778-017-0482-5","volume":"26","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Chen, Y., Luo, S., Hu, J.: Effective and efficient attributed community search. VLDB J. 26(6), 803\u2013828 (2017)","journal-title":"VLDB J."},{"issue":"1","key":"649_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. VLDB J. 29(1), 353\u2013392 (2020)","journal-title":"VLDB J."},{"issue":"11","key":"649_CR13","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1109\/TKDE.2018.2872982","volume":"31","author":"Y Fang","year":"2018","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. IEEE Trans. Knowl. Data Eng. 31(11), 2093\u20132107 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"649_CR14","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. Siam Review 24(1), 90 (1982)","journal-title":"Siam Rev."},{"issue":"4\u20136","key":"649_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","volume":"76","author":"E Hartuv","year":"2000","unstructured":"Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Inf. Process. Lett. 76(4\u20136), 175\u2013181 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"649_CR16","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1109\/TKDE.2017.2730873","volume":"29","author":"J Hu","year":"2017","unstructured":"Hu, J., Wu, X., Cheng, R., Luo, S., Fang, Y.: On minimal steiner maximum-connected subgraph queries. IEEE Trans. Knowl. Data Eng. 29(11), 2455\u20132469 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"649_CR17","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"649_CR18","doi-asserted-by":"crossref","unstructured":"Huang, X., Lakshmanan, L.V., Xu, J.: Community Search over Big Graphs. Morgan & Claypool Publishers (2019)","DOI":"10.2200\/S00928ED1V01Y201906DTM061"},{"issue":"4","key":"649_CR19","first-page":"276","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V., Yu, J.X., Cheng, H.: Approximate closest community search in networks. PVLDB 9(4), 276\u2013287 (2015)","journal-title":"PVLDB"},{"issue":"9","key":"649_CR20","first-page":"949","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang, X., Lakshmanan, L.V.S.: Attribute-driven community search. PVLDB 10(9), 949\u2013960 (2017)","journal-title":"PVLDB"},{"key":"649_CR21","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.S.: Truss decomposition of probabilistic graphs: semantics and algorithms. In: SIGMOD, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"issue":"4","key":"649_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0020-0190(00)00098-3","volume":"75","author":"F Leu","year":"2000","unstructured":"Leu, F., Tsai, Y., Tang, C.Y.: An efficient external sorting algorithm. Inf. Process. Lett. 75(4), 159\u2013163 (2000)","journal-title":"Inf. Process. Lett."},{"key":"649_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: SIGMOD, pp. 2183\u20132197 (2020)","DOI":"10.1145\/3318464.3380587"},{"key":"649_CR24","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhu, Y., Zhao, M., Huang, X., Xu, J., Gao, Y.: Vac: vertex-centric attributed community search. In: ICDE, pp. 937\u2013948 (2020)","DOI":"10.1109\/ICDE48307.2020.00086"},{"issue":"1\u20132","key":"649_CR25","first-page":"693","volume":"3","author":"K Macropol","year":"2010","unstructured":"Macropol, K., Singh, A.: Scalable discovery of best clusters on large graphs. PVLDB 3(1\u20132), 693\u2013702 (2010)","journal-title":"PVLDB"},{"key":"649_CR26","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Zeh, N.: A survey of techniques for designing i\/o-efficient algorithms. In: Algorithms for Memory Hierarchies, pp. 36\u201361 (2002)","DOI":"10.1007\/3-540-36574-5_3"},{"issue":"1","key":"649_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","volume":"29","author":"F Malliaros","year":"2020","unstructured":"Malliaros, F., Giatsidis, C., Papadopoulos, A., Vazirgiannis, M.: The core decomposition of networks: Theory, algorithms and applications. VLDB J. 29(1), 61\u201392 (2020)","journal-title":"VLDB J."},{"key":"649_CR28","unstructured":"McAuley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS, pp. 548\u2013556 (2012)"},{"issue":"2","key":"649_CR29","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Physical review E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"649_CR30","first-page":"433","volume":"6","author":"AE Sar\u0131y\u00fcce","year":"2013","unstructured":"Sar\u0131y\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.L., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. PVLDB 6(6), 433\u2013444 (2013)","journal-title":"PVLDB"},{"key":"649_CR31","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"649_CR32","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: KDD, pp. 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"},{"issue":"16","key":"649_CR33","doi-asserted-by":"publisher","first-page":"5962","DOI":"10.1073\/pnas.1116502109","volume":"109","author":"J Ugander","year":"2012","unstructured":"Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.: Structural diversity in social contagion. Proc. Natl. Acad. Sci. 109(16), 5962\u20135966 (2012)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"9","key":"649_CR34","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"},{"issue":"1","key":"649_CR35","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TKDE.2018.2833070","volume":"31","author":"D Wen","year":"2019","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/o efficient core graph decomposition: Application to degeneracy ordering. IEEE Trans. Knowl. Data Eng. 31(1), 75\u201390 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7","key":"649_CR36","first-page":"798","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu, Y., Jin, R., Li, J., Zhang, X.: Robust local community detection: on free rider effect and its elimination. PVLDB 8(7), 798\u2013809 (2015)","journal-title":"PVLDB"},{"issue":"4","key":"649_CR37","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2501654.2501657","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv. 45(4), 43 (2013)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"649_CR38","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Trans. Knowl. Data Eng. 30(5), 922\u2013935 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"649_CR39","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: ICDE, pp. 1049\u20131060 (2012)","DOI":"10.1109\/ICDE.2012.35"},{"key":"649_CR40","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X.: Unboundedness and efficiency of truss maintenance in evolving graphs. In: SIGMOD, pp. 1024\u20131041 (2019)","DOI":"10.1145\/3299869.3300082"},{"key":"649_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Huang, X., Xu, J., Choi, B., Shang, Z.: Keyword-centric community search. In: ICDE, pp. 422\u2013433 (2019)","DOI":"10.1109\/ICDE.2019.00045"},{"key":"649_CR42","doi-asserted-by":"crossref","unstructured":"Zheng, D., Liu, J., Li, R.H., Aslay, C., Chen, Y.C., Huang, X.: Querying intimate-core groups in weighted graphs. In: IEEE ICSC, pp. 156\u2013163 (2017)","DOI":"10.1109\/ICSC.2017.80"},{"key":"649_CR43","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2017.07.012","volume":"417","author":"Z Zheng","year":"2017","unstructured":"Zheng, Z., Ye, F., Li, R.H., Ling, G., Jin, T.: Finding weighted k-truss communities in large networks. Inf. Sci. 417, 344\u2013360 (2017)","journal-title":"Inf. Sci."},{"key":"649_CR44","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: Diversified coherent core search on multi-layer graphs. In: ICDE, pp. 701\u2013712 (2018)","DOI":"10.1109\/ICDE.2018.00069"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00649-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-020-00649-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00649-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T10:31:43Z","timestamp":1628591503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-020-00649-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s00778-020-00649-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,22]]},"assertion":[{"value":"4 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}