{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:56Z","timestamp":1773481976881,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,12,31]],"date-time":"2016-12-31T00:00:00Z","timestamp":1483142400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ARC","award":["DE140100999"],"award-info":[{"award-number":["DE140100999"]}]},{"name":"ARC","award":["DP160101513"],"award-info":[{"award-number":["DP160101513"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["NSFC61232006"],"award-info":[{"award-number":["NSFC61232006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ARC","award":["DP140103578"],"award-info":[{"award-number":["DP140103578"]}]},{"name":"ARC","award":["DE150100563"],"award-info":[{"award-number":["DE150100563"]}]},{"name":"ARC","award":["DP150103071"],"award-info":[{"award-number":["DP150103071"]}]},{"name":"ARC","award":["DP150102728"],"award-info":[{"award-number":["DP150102728"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00778-016-0451-4","type":"journal-article","created":{"date-parts":[[2016,12,31]],"date-time":"2016-12-31T07:50:53Z","timestamp":1483170653000},"page":"275-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["I\/O efficient ECC graph decomposition via graph reduction"],"prefix":"10.1007","volume":"26","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":[[2016,12,31]]},"reference":[{"key":"451_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M.G., Sudarsky, S.: Massive quasi-clique detection. In: Latin American Symposium on Theoretical Informatics, pp. 598\u2013612 (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"issue":"9","key":"451_CR2","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":"451_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Rajagopalan, S., Srikant, R., Xu, Y.: Mining newsgroups using networks arising from social behavior. In: Proceedings of WWW, pp. 529\u2013535 (2003)","DOI":"10.1145\/775152.775227"},{"key":"451_CR4","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In: Proceedings CIKM, pp. 909\u2013918 (2013)","DOI":"10.1145\/2505515.2505751"},{"key":"451_CR5","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: Advances in Neural Information Processing Systems, pp. 41\u201350 (2005)"},{"key":"451_CR6","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: How the k-core decomposition helps in understanding the internet topology. In: ISMA Workshop on the Internet Topology, vol. 1 (2006)"},{"issue":"2","key":"451_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3934\/nhm.2008.3.371","volume":"3","author":"JI Alvarez-Hamelin","year":"2008","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Netw. Heterog. Media 3(2), 371\u2013393 (2008)","journal-title":"Netw. Heterog. Media"},{"issue":"27","key":"451_CR8","doi-asserted-by":"crossref","first-page":"11150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., Shir, E.: A model of internet topology using k-shell decomposition. Proc. Natl Acad. Sci. 104(27), 11150\u201311154 (2007)","journal-title":"Proc. Natl Acad. Sci."},{"key":"451_CR9","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: Proceedings of the SIGMOD, pp. 459\u2013474 (2015)","DOI":"10.1145\/2723372.2746486"},{"key":"451_CR10","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: Proceedings of the SIGMOD, pp. 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"issue":"18","key":"451_CR11","doi-asserted-by":"crossref","first-page":"2283","DOI":"10.1093\/bioinformatics\/btl370","volume":"22","author":"J Chen","year":"2006","unstructured":"Chen, J., Yuan, B.: Detecting functional modules in the yeast protein-protein interaction network. Bioinformatics 22(18), 2283\u20132290 (2006)","journal-title":"Bioinformatics"},{"key":"451_CR12","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., Ozsu. M.T.: Efficient core decomposition in massive networks. In: Proceedings of the ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"451_CR13","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 the SIGKDD, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"issue":"4","key":"451_CR14","doi-asserted-by":"crossref","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), 175\u2013181 (2000)","journal-title":"Inf. Process. Lett."},{"key":"451_CR15","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.: Massive graph triangulation. In: Proceedings of the SIGMOD, pp. 325\u2013336 (2013)","DOI":"10.1145\/2463676.2463704"},{"issue":"6","key":"451_CR16","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/TVCG.2008.151","volume":"14","author":"Y Jia","year":"2008","unstructured":"Jia, Y., Hoberock, J., Garland, M., Hart, J.: On the visualization of social and other scale-free networks. IEEE Trans. Vis. Comput. Graph. 14(6), 1285\u20131292 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"451_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce, R.D.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2), 169\u2013190 (1950)","journal-title":"Psychometrika"},{"issue":"2","key":"451_CR18","doi-asserted-by":"crossref","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. Psychometrika 14(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"issue":"2","key":"451_CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"TL Magnanti","year":"2005","unstructured":"Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks 45(2), 61\u201379 (2005)","journal-title":"Networks"},{"issue":"2","key":"451_CR20","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 210(2), 305\u2013325 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20136","key":"451_CR21","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7(1\u20136), 583\u2013596 (1992)","journal-title":"Algorithmica"},{"key":"451_CR22","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: Proceedings of the SIGKDD, pp. 228\u2013238 (2005)","DOI":"10.1145\/1081870.1081898"},{"issue":"3","key":"451_CR23","doi-asserted-by":"crossref","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. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"21","key":"451_CR24","doi-asserted-by":"crossref","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. 100(21), 12123\u201312128 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"451_CR25","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","DOI":"10.14778\/2311906.2311909"},{"issue":"2","key":"451_CR26","first-page":"58","volume":"4","author":"N Wang","year":"2010","unstructured":"Wang, N., Zhang, J., Tan, K., Tung, A.K.H.: On triangulation-based dense neighborhood graphs discovery. PVLDB 4(2), 58\u201368 (2010)","journal-title":"PVLDB"},{"issue":"1","key":"451_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1111\/0081-1750.00098","volume":"31","author":"DR White","year":"2001","unstructured":"White, D.R., Harary, F.: The cohesiveness of blocks in social networks: node connectivity and conditional density. Sociol. Methodol. 31(1), 305\u2013359 (2001)","journal-title":"Sociol. Methodol."},{"key":"451_CR28","doi-asserted-by":"crossref","unstructured":"Yan, X., Zhou, X., Han, J.: Mining closed relational graphs with connectivity constraints. In: Proceedings of the SIGKDD, pp. 324\u2013333 (2005)","DOI":"10.1145\/1081870.1081908"},{"issue":"2","key":"451_CR29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. VLDB J. 25(2), 171\u2013196 (2016)","journal-title":"VLDB J."},{"issue":"7","key":"451_CR30","first-page":"516","volume":"9","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: I\/O efficient ecc graph decomposition via graph reduction. PVLDB 9(7), 516\u2013527 (2016)","journal-title":"PVLDB"},{"key":"451_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: Proceedings of the ICDE, pp. 1049\u20131060 (2012)","DOI":"10.1109\/ICDE.2012.35"},{"key":"451_CR32","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 the SIGMOD, pp. 245\u2013270 (2013)","DOI":"10.1145\/2463676.2463703"},{"key":"451_CR33","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 the SIGMOD, pp. 445\u2013458 (2015)","DOI":"10.1145\/2723372.2723740"},{"key":"451_CR34","doi-asserted-by":"crossref","unstructured":"Zhou, R., Liu, C., Yu, J.X., Liang, W., Chen, B., Li, J.: Finding maximal k-edge-connected subgraphs from a large graph. In: Proceedings of the EDBT, pp. 480\u2013491 (2012)","DOI":"10.1145\/2247596.2247652"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-016-0451-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-016-0451-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-016-0451-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T22:58:55Z","timestamp":1568674735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-016-0451-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,31]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["451"],"URL":"https:\/\/doi.org\/10.1007\/s00778-016-0451-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,31]]}}}