{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T16:50:58Z","timestamp":1771606258377,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319556987","type":"print"},{"value":"9783319556994","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55699-4_25","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:56:53Z","timestamp":1490054213000},"page":"404-421","source":"Crossref","is-referenced-by-count":13,"title":["Effective k-Vertex Connected Component Detection in Large-Scale Networks"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Li","sequence":"first","affiliation":[]},{"given":"Yuhai","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Feida","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Yubao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Shengle","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"25_CR1","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: CIKM, pp. 909\u2013918 (2013)","DOI":"10.1145\/2505515.2505751"},{"key":"25_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Berlowitz, D., Cohen, S., Kimelfeld, B.: Efficient enumeration of maximal k-plexes. In: SIGMOD, pp. 431\u2013444 (2015)","DOI":"10.1145\/2723372.2746478"},{"issue":"1","key":"25_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. Comput. Netw. 33(1), 309\u2013320 (2000)","journal-title":"Comput. Netw."},{"key":"25_CR5","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: SIGMOD, pp. 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"25_CR6","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"},{"key":"25_CR7","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":"25_CR8","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2005)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230140211","volume":"14","author":"AH Esfahanian","year":"1984","unstructured":"Esfahanian, A.H., Louis Hakimi, S.: On computing the connectivities of graphs and digraphs. Networks 14(2), 355\u2013366 (1984)","journal-title":"Networks"},{"issue":"4","key":"25_CR10","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S Even","year":"1975","unstructured":"Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput. 4(4), 507\u2013518 (1975)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR11","doi-asserted-by":"crossref","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."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Hariharan, R., Kavitha, T., Panigrahi, D., Bhalgat, A.: An o(mn) gomory-hu tree construction algorithm for unweighted graphs. In: ACM Symposium on Theory of Computing, pp. 605\u2013614 (2007)","DOI":"10.1145\/1250790.1250879"},{"key":"25_CR13","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"},{"issue":"10","key":"25_CR14","first-page":"681","volume":"4","author":"M Kargar","year":"2011","unstructured":"Kargar, M., An, A.: Keyword search in graphs: finding r-cliques. PVLDB 4(10), 681\u2013692 (2011)","journal-title":"PVLDB"},{"key":"25_CR15","unstructured":"Lee, C., Reid, F., McDaid, A., Hurley, N.: Detecting highly overlapping community structure by greedy clique expansion. arXiv preprint arXiv:1002.1827 (2010)"},{"issue":"2","key":"25_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken, R.J.: Cliques, clubs and clans. Qual. Quant. 13(2), 161\u2013173 (1979)","journal-title":"Qual. Quant."},{"issue":"3","key":"25_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1017\/S0963548398003526","volume":"7","author":"M Molloy","year":"1998","unstructured":"Molloy, M., Reed, B.: The size of the giant component of a random graph with a given degree sequence. Comb. Probab. Comput. 7(3), 295\u2013305 (1998)","journal-title":"Comb. Probab. Comput."},{"issue":"7043","key":"25_CR18","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"1","key":"25_CR19","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1), 9\u201318 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: SIGKDD, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"issue":"4","key":"25_CR21","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM (JACM) 44(4), 585\u2013591 (1997)","journal-title":"J. ACM (JACM)"},{"issue":"9","key":"25_CR22","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":"2","key":"25_CR23","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":"7","key":"25_CR24","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"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Wu, Y., Jin, R., Zhu, X., Zhang, X.: Finding dense and connected subgraphs in dual networks. In: ICDE, pp. 915\u2013926 (2015)","DOI":"10.1109\/ICDE.2015.7113344"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: ICDM, pp. 745\u2013754 (2012)","DOI":"10.1145\/2350190.2350193"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Wang, J., Zhou, L., Karypis, G.: Coherent closed quasi-clique discovery from large dense graph databases. In: KDD, pp. 797\u2013802 (2006)","DOI":"10.1145\/1150402.1150506"},{"key":"25_CR28","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: EDBT, pp. 480\u2013491 (2012)","DOI":"10.1145\/2247596.2247652"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55699-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T20:48:34Z","timestamp":1568926114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55699-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319556987","9783319556994"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55699-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}