{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:57:29Z","timestamp":1775638649593,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00778-019-00541-4","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T05:29:56Z","timestamp":1557293396000},"page":"377-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Efficient structural graph clustering: an index-based approach"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0903-1503","authenticated-orcid":false,"given":"Dong","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,8]]},"reference":[{"key":"541_CR1","doi-asserted-by":"crossref","unstructured":"Bortner, D., Han, J.: Progressive clustering of networks using structure-connected order of traversal. In: Proceedings of ICDE\u201910, pp. 653\u2013656 (2010)","DOI":"10.1109\/ICDE.2010.5447895"},{"key":"541_CR2","doi-asserted-by":"crossref","unstructured":"Chang, L., Li, W., Lin, X., Qin, L., Zhang, W.: pSCAN: fast and exact structural graph clustering. In: ICDE, pp. 253\u2013264 (2016)","DOI":"10.1109\/ICDE.2016.7498245"},{"key":"541_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., T. \u00d6zsu, M.: Efficient core decomposition in massive networks. In: ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"541_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Fu, A.W.-C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks by h*-graph. In: SIGMOD, pp. 447\u2013458 (2010)","DOI":"10.1145\/1807167.1807217"},{"issue":"1","key":"541_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. SICOMP 14(1), 210\u2013223 (1985)","journal-title":"SICOMP"},{"key":"541_CR6","unstructured":"Ding, C.H., He, X., Zha, H., Gu, M., Simon, H.D.: A min\u2013max cut algorithm for graph partitioning and data clustering. In: ICDM, pp. 107\u2013114 (2001)"},{"issue":"3","key":"541_CR7","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(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"3","key":"541_CR8","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. JACM 34(3), 596\u2013615 (1987)","journal-title":"JACM"},{"issue":"7028","key":"541_CR9","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1038\/nature03288","volume":"433","author":"R Guimera","year":"2005","unstructured":"Guimera, R., Amaral, L.A.N.: Functional cartography of complex metabolic networks. Nature 433(7028), 895 (2005)","journal-title":"Nature"},{"key":"541_CR10","doi-asserted-by":"crossref","unstructured":"Huang, J., Sun, H., Han, J., Deng, H., Sun, Y., Liu, Y.: Shrink: a structural clustering algorithm for detecting hierarchical communities in networks. In: CIKM, pp. 219\u2013228 (2010)","DOI":"10.1145\/1871437.1871469"},{"issue":"8","key":"541_CR11","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1093\/bioinformatics\/btq078","volume":"26","author":"P Jiang","year":"2010","unstructured":"Jiang, P., Singh, M.: Spici: a fast clustering algorithm for large biological networks. Bioinformatics 26(8), 1105\u20131111 (2010)","journal-title":"Bioinformatics"},{"key":"541_CR12","doi-asserted-by":"crossref","unstructured":"Kang, U., Faloutsos, C.: Beyond \u2018Caveman Communities\u2019: hubs and spokes for graph compression and mining. In: ICDM, pp. 300\u2013309 (2011)","DOI":"10.1109\/ICDM.2011.26"},{"key":"541_CR13","doi-asserted-by":"crossref","unstructured":"Lee, V.\u00a0E., Ruan, N., Jin, R., Aggarwal, C.: A survey of algorithms for dense subgraph discovery. In: Managing and Mining Graph Data, pp. 303\u2013336 (2010)","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"541_CR14","doi-asserted-by":"crossref","unstructured":"Lim, S., Ryu, S., Kwon, S., Jung, K., Lee, J.-G.: Linkscan*: overlapping community detection using the link-space transformation. In: ICDE, pp. 292\u2013303 (2014)","DOI":"10.1109\/ICDE.2014.6816659"},{"key":"541_CR15","doi-asserted-by":"crossref","unstructured":"Mai, S.T., Dieu, M.S., Assent, I., Jacobsen, J., Kristensen, J., Birk, M.: Scalable and interactive graph clustering algorithm on multicore cpus. In: ICDE, pp. 349\u2013360 (2017)","DOI":"10.1109\/ICDE.2017.94"},{"issue":"2","key":"541_CR16","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. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"541_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"issue":"8","key":"541_CR18","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. TPAMI 22(8), 888\u2013905 (2000)","journal-title":"TPAMI"},{"key":"541_CR19","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.: Fast algorithm for modularity-based graph clustering. In: AAAI, pp. 1170\u20131176 (2013)","DOI":"10.1609\/aaai.v27i1.8455"},{"issue":"11","key":"541_CR20","first-page":"1178","volume":"8","author":"H Shiokawa","year":"2015","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.: Scan++: efficient algorithm for finding clusters, hubs and outliers on large-scale graphs. PVLDB 8(11), 1178\u20131189 (2015)","journal-title":"PVLDB"},{"key":"541_CR21","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Takahashi, T., Kitagawa, H.: Scalescan: scalable density-based graph clustering. In: Database and Expert Systems Applications, pp. 18\u201334 (2018)","DOI":"10.1007\/978-3-319-98809-2_2"},{"key":"541_CR22","unstructured":"Son, M.\u00a0T., Amer-Yahia, S., Assent, I., Birk, M., Storgaard Dieu, M. Jacobsen, J., Kristensen, J.: Scalable interactive dynamic graph clustering on multicore CPUs. In: TKDE (2018)"},{"key":"541_CR23","doi-asserted-by":"crossref","unstructured":"Sun, H., Huang, J., Han, J. Deng, H., Zhao, P., Feng, B.: gSkeletonClu: Density-based network clustering via structure-connected tree division or agglomeration. In: ICDM, pp. 481\u2013490 (2010)","DOI":"10.1109\/ICDM.2010.69"},{"key":"541_CR24","doi-asserted-by":"crossref","unstructured":"Takahashi, T., Shiokawa, H., Kitagawa, H.: SCAN-XP: parallel structural graph clustering algorithm on Intel Xeon Phi coprocessors. In: Proceedings of the 2nd International Workshop on Network Data Analytics, NDA, pp. 6:1\u20136:7 (2017)","DOI":"10.1145\/3068943.3068949"},{"key":"541_CR25","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. ACM (2013)","DOI":"10.1145\/2487575.2487645"},{"issue":"9","key":"541_CR26","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":"541_CR27","doi-asserted-by":"crossref","unstructured":"Wang, L., Xiao, Y., Shao, B., Wang, H.: How to partition a billion-node graph. In: ICDE (2014)","DOI":"10.1109\/ICDE.2014.6816682"},{"issue":"2","key":"541_CR28","first-page":"58","volume":"4","author":"N Wang","year":"2010","unstructured":"Wang, N., Zhang, J., Tan, K.-L., Tung, A.K.: On triangulation-based dense neighborhood graph discovery. PVLDB 4(2), 58\u201368 (2010)","journal-title":"PVLDB"},{"issue":"3","key":"541_CR29","first-page":"243","volume":"11","author":"D Wen","year":"2017","unstructured":"Wen, D., Qin, L., Zhang, Y., Chang, L., Lin, X.: Efficient structural graph clustering: an index-based approach. PVLDB 11(3), 243\u2013255 (2017)","journal-title":"PVLDB"},{"key":"541_CR30","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/o efficient core graph decomposition at web scale. In: ICDE, pp. 133\u2013144 (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"541_CR31","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: KDD, pp. 824\u2013833 (2007)","DOI":"10.1145\/1281192.1281280"},{"key":"541_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Yu, J.X., Qin, L., Shang, Z.: Divide & conquer: I\/o efficient depth-first search. In: SIGMOD, pp. 445\u2013458 (2015)","DOI":"10.1145\/2723372.2723740"},{"key":"541_CR33","doi-asserted-by":"crossref","unstructured":"Zhao, W., Chen, G., Xu, X.: AnySCAN: an efficient anytime framework with active learning for large-scale network clustering. In: ICDM, pp. 665\u2013674 (2017)","DOI":"10.1109\/ICDM.2017.76"},{"key":"541_CR34","unstructured":"Zhao, W., Martha, V., Xu, X.: PSCAN: a parallel structural clustering algorithm for big networks in MapReduce. In: AINA, pp. 862\u2013869 (2013)"},{"issue":"1","key":"541_CR35","first-page":"718","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. PVLDB 2(1), 718\u2013729 (2009)","journal-title":"PVLDB"},{"key":"541_CR36","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Mag. 17, 73\u201383 (1996)","journal-title":"AI Mag."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00541-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00541-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00541-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T14:59:47Z","timestamp":1663426787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00541-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,8]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00541-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,8]]},"assertion":[{"value":"6 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}