{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:57:27Z","timestamp":1775638647995,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T00:00:00Z","timestamp":1496102400000},"content-version":"unspecified","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":[[2017,12]]},"DOI":"10.1007\/s00778-017-0467-4","type":"journal-article","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T07:14:37Z","timestamp":1496128477000},"page":"751-776","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["Finding influential communities in massive networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Rong-Hua","family":"Li","sequence":"first","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Mao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,30]]},"reference":[{"key":"467_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 (2013)","DOI":"10.1145\/2505515.2505751"},{"key":"467_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"issue":"2","key":"467_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., Zaversnik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 5(2), 129\u2013145 (2011)","journal-title":"Adv. Data Anal. Classif."},{"key":"467_CR4","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 (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"467_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: ICDE (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"4","key":"467_CR6","doi-asserted-by":"crossref","first-page":"21","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 (2011)","journal-title":"ACM Trans. Database Syst."},{"key":"467_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: KDD (2012)","DOI":"10.1145\/2339530.2339724"},{"issue":"1","key":"467_CR8","doi-asserted-by":"crossref","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":"467_CR9","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. Technique report (2005)"},{"key":"467_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"467_CR11","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: SIGMOD (2013)","DOI":"10.1145\/2463676.2463722"},{"key":"467_CR12","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD (2014)","DOI":"10.1145\/2588555.2612179"},{"issue":"3\u20135","key":"467_CR13","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\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"1","key":"467_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.comnet.2012.09.011","volume":"57","author":"E Gregori","year":"2013","unstructured":"Gregori, E., Lenzini, L., Orsini, C.: k-dense communities in the internet as-level topology graph. Comput. Netw. 57(1), 213\u2013227 (2013)","journal-title":"Comput. Netw."},{"key":"467_CR15","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.W.: Massive graph triangulation. In: SIGMOD (2013)","DOI":"10.1145\/2463676.2463704"},{"key":"467_CR16","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. SIGMOD (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"467_CR17","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, Hoboken (1995)"},{"issue":"5","key":"467_CR18","first-page":"509","volume":"8","author":"R Li","year":"2015","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"issue":"10","key":"467_CR19","doi-asserted-by":"crossref","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"R Li","year":"2014","unstructured":"Li, R., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. IEEE Trans. Knowl. Data Eng. 26(10), 2453\u20132465 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"467_CR20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2011.12.006","volume":"426","author":"MC Lin","year":"2012","unstructured":"Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.: Arboricity, h-index, and dynamic algorithms. Theor. Comput. Sci. 426, 75\u201390 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"467_CR21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/3088904","volume":"68","author":"J Moody","year":"2003","unstructured":"Moody, J., White, D.R.: Structural cohesion and embeddedness: a hierarchical concept of social groups. Am. Sociol. Rev. 68, 103\u2013127 (2003)","journal-title":"Am. Sociol. Rev."},{"key":"467_CR22","doi-asserted-by":"crossref","unstructured":"Saito, K., Yamada, T.: Extracting communities from complex networks by the k-dense method. In: ICDM Workshops (2006)","DOI":"10.1109\/ICDMW.2006.76"},{"issue":"6","key":"467_CR23","first-page":"433","volume":"6","author":"AE Sariy\u00fcce","year":"2013","unstructured":"Sariy\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"},{"issue":"3","key":"467_CR24","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."},{"key":"467_CR25","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"467_CR26","doi-asserted-by":"crossref","unstructured":"Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.: Structural diversity in social contagion. PNAS (2011)","DOI":"10.1073\/pnas.1116502109"},{"issue":"9","key":"467_CR27","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":"467_CR28","first-page":"58","volume":"4","author":"N Wang","year":"2010","unstructured":"Wang, N., Zhang, J., Tan, K.L., Tung, A.K.H.: On triangulation-based dense neighborhood graphs discovery. PVLDB 4(2), 58\u201368 (2010)","journal-title":"PVLDB"},{"key":"467_CR29","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 (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"issue":"4","key":"467_CR30","first-page":"43","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."},{"key":"467_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting, analyzing and visualizing triangle k-core motifs within networks. In: ICDE (2012)","DOI":"10.1109\/ICDE.2012.35"},{"key":"467_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: SIGMOD (2013)","DOI":"10.1145\/2463676.2463703"},{"key":"467_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Yu, J.X., Qin, L., Shang, Z.: Divide & conquer: I\/O efficient depth-first search. In: SIGMOD (2015)","DOI":"10.1145\/2723372.2723740"},{"issue":"2","key":"467_CR34","first-page":"85","volume":"6","author":"F Zhao","year":"2012","unstructured":"Zhao, F., Tung, A.K.H.: Large scale cohesive subgraphs discovery for social network visual analysis. PVLDB 6(2), 85\u201396 (2012)","journal-title":"PVLDB"},{"key":"467_CR35","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 (2012)","DOI":"10.1145\/2247596.2247652"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0467-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0467-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0467-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T23:17:13Z","timestamp":1659050233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0467-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,30]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["467"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0467-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,30]]}}}