{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:34:00Z","timestamp":1776134040202,"version":"3.50.1"},"reference-count":223,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T00:00:00Z","timestamp":1563580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T00:00:00Z","timestamp":1563580800000},"content-version":"vor","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":[[2020,1]]},"DOI":"10.1007\/s00778-019-00556-x","type":"journal-article","created":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:02:21Z","timestamp":1563634941000},"page":"353-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":275,"title":["A survey of community search over big graphs"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5047-8593","authenticated-orcid":false,"given":"Yixiang","family":"Fang","sequence":"first","affiliation":[]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,20]]},"reference":[{"key":"556_CR1","unstructured":"Amazon mechanical turk. https:\/\/www.mturk.com\/"},{"key":"556_CR2","unstructured":"Clique (graph theory). https:\/\/en.wikipedia.org\/wiki\/Clique_(graph_theory)"},{"key":"556_CR3","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/11957454_3","volume-title":"Privacy Enhancing Technologies","author":"Alessandro Acquisti","year":"2006","unstructured":"Acquisti, A., Gross, R.: Imagined communities: awareness, information sharing, and privacy on the facebook. In: International Workshop on Privacy Enhancing Technologies, pp. 36\u201358 (2006)"},{"issue":"8","key":"556_CR4","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1093\/bioinformatics\/btl039","volume":"22","author":"B Adamcsek","year":"2006","unstructured":"Adamcsek, B., Palla, G., Farkas, I.J., Der\u00e9nyi, I., Vicsek, T.: Cfinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22(8), 1021\u20131023 (2006)","journal-title":"Bioinformatics"},{"key":"556_CR5","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Fotakis, D., Ullman, J.D.: Enumerating subgraph instances using map-reduce. In: ICDE, pp. 62\u201373. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544814"},{"issue":"11","key":"556_CR6","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":"556_CR7","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":"556_CR8","first-page":"105","volume-title":"Lecture Notes in Social Networks","author":"Alessia Amelio","year":"2014","unstructured":"Amelio, A., Pizzuti, C.: Overlapping community discovery methods: A survey. In: Social Networks: Analysis and Case Studies, pp. 105\u2013125 (2014)"},{"key":"556_CR9","doi-asserted-by":"crossref","unstructured":"Andersen, R., Lang, K.J.: Communities from seed sets. In: WWW, pp. 223\u2013232 (2006)","DOI":"10.1145\/1135777.1135814"},{"issue":"31","key":"556_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.17485\/ijst\/2015\/v8i31\/70569","volume":"8","author":"A Angadi","year":"2015","unstructured":"Angadi, A., Varma, P.S.: Overlapping community detection in temporal networks. Indian J. Sci. Technol. 8(31), 1\u20136 (2015)","journal-title":"Indian J. Sci. Technol."},{"key":"556_CR11","doi-asserted-by":"crossref","unstructured":"Archer, A., Lattanzi, S., Likarish, P., Vassilvitskii, S.: Indexing public-private graphs. In: WWW, pp. 1461\u20131470 (2017)","DOI":"10.1145\/3038912.3052683"},{"issue":"10","key":"556_CR12","first-page":"913","volume":"6","author":"N Armenatzoglou","year":"2013","unstructured":"Armenatzoglou, N., Papadopoulos, S., Papadias, D.: A general framework for geo-social query processing. PVLDB 6(10), 913\u2013924 (2013)","journal-title":"PVLDB"},{"key":"556_CR13","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R., Hurtado, C., Mendoza, M. : Query recommendation using query logs in search engines. In: International Conference on Extending Database Technology, pp. 588\u2013596. Springer (2004)","DOI":"10.1007\/978-3-540-30192-9_58"},{"issue":"1","key":"556_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59(1), 133\u2013142 (2011)","journal-title":"Oper. Res."},{"issue":"5","key":"556_CR15","first-page":"1406","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. DMKD 29(5), 1406\u20131433 (2015)","journal-title":"DMKD"},{"issue":"1","key":"556_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2010.11.002","volume":"499","author":"M Barth\u00e9lemy","year":"2011","unstructured":"Barth\u00e9lemy, M.: Spatial networks. Phys. Rep. 499(1), 1\u2013101 (2011)","journal-title":"Phys. Rep."},{"key":"556_CR17","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv:cs\/0310049 (2003)"},{"issue":"3","key":"556_CR18","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1007\/s10586-015-0472-6","volume":"18","author":"O Batarfi","year":"2015","unstructured":"Batarfi, O., Shawi, R.E., Fayoumi, A.G., Nouri, R., Beheshti, S.-M.-R., Barnawi, A., Sakr, S.: Large scale graph processing systems: survey and an experimental evaluation. Clust. Comput. 18(3), 1189\u20131213 (2015)","journal-title":"Clust. Comput."},{"issue":"1","key":"556_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/15M1009615","volume":"14","author":"M Bazzi","year":"2016","unstructured":"Bazzi, M., Porter, M.A., Williams, S., McDonald, M., Fenn, D.J., Howison, S.D.: Community detection in temporal multilayer networks, with an application to correlation networks. Multiscale Model. Simul. 14(1), 1\u201341 (2016)","journal-title":"Multiscale Model. Simul."},{"key":"556_CR20","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431\u2013440. IEEE (2002)"},{"issue":"9","key":"556_CR21","first-page":"1056","volume":"11","author":"F Bi","year":"2018","unstructured":"Bi, F., Chang, L., Lin, X., Zhang, W.: An optimal and progressive approach to online search of top-k influential communities. PVLDB 11(9), 1056\u20131068 (2018)","journal-title":"PVLDB"},{"issue":"1\u20136","key":"556_CR22","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\u20136), 309\u2013320 (2000)","journal-title":"Comput. Netw."},{"key":"556_CR23","first-page":"41","volume-title":"Lecture Notes in Computer Science","author":"Mauro Brunato","year":"2008","unstructured":"Brunato, M., Hoos, H. H., Battiti, R.: On effectively finding maximal quasi-cliques in graphs. In: International Conference on Learning and Intelligent Optimization, pp. 41\u201355 (2007)"},{"key":"556_CR24","first-page":"24","volume-title":"Neural Information Processing","author":"Lijun Cai","year":"2017","unstructured":"Cai, L., Meng, T., He, T., Chen, L., Deng, Z.: K-hop community search based on local distance dynamics. In: International Conference on Neural Information Processing, pp. 24\u201334 (2017)"},{"key":"556_CR25","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":"556_CR26","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":"556_CR27","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"Moses Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 84\u201395 (2000)"},{"issue":"10","key":"556_CR28","first-page":"1233","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. PVLDB 11(10), 1233\u20131246 (2018)","journal-title":"PVLDB"},{"key":"556_CR29","doi-asserted-by":"crossref","unstructured":"Chen, P.-L., Chou, C.-K., Chen, M.-S. : Distributed algorithms for k-truss decomposition. In: International Conference on Big Data, pp. 471\u2013480 (2014)","DOI":"10.1109\/BigData.2014.7004264"},{"key":"556_CR30","doi-asserted-by":"crossref","unstructured":"Chen, S., Wei, R., Popova, D., Thomo, A.: Efficient computation of importance based communities in web-scale networks using a single machine. In: CIKM, pp. 1553\u20131562 (2016)","DOI":"10.1145\/2983323.2983836"},{"issue":"8","key":"556_CR31","first-page":"1624","volume":"31","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Fang, Y., Cheng, R., Li, Y., Chen, X., Zhang, J.: Exploring communities in large profiled graphs. TKDE 31(8), 1624\u20131629 (2019)","journal-title":"TKDE"},{"issue":"6","key":"556_CR32","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1080\/13658816.2014.999244","volume":"29","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Xu, J., Xu, M.: Finding community structure in spatially constrained complex networks. Int. J. Geogr. Inf. Sci. 29(6), 889\u2013911 (2015)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"3","key":"556_CR33","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/s10618-012-0263-0","volume":"25","author":"H Cheng","year":"2012","unstructured":"Cheng, H., Zhou, Y., Huang, X., Yu, J.X.: Clustering large attributed information networks: an efficient incremental computing approach. Data Min. Knowl. Discov. 25(3), 450\u2013477 (2012)","journal-title":"Data Min. Knowl. Discov."},{"key":"556_CR34","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":"556_CR35","unstructured":"Cheng, J., Zeng, X., Yu, J. X.: Top-k graph pattern matching over large graphs. In: ICDE, pp. 1033\u20131044. IEEE (2013)"},{"key":"556_CR36","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: SIGKDD, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"issue":"1","key":"556_CR37","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":"556_CR38","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Epasto, A., Kumar, R., Lattanzi, S., Mirrokni, V.: Efficient algorithms for public-private social networks. In: SIGKDD, pp. 139\u2013148. ACM (2015)","DOI":"10.1145\/2783258.2783354"},{"key":"556_CR39","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks and its applications. In: SIGKDD, pp. 672\u2013680. ACM (2011)","DOI":"10.1145\/2020408.2020513"},{"issue":"2","key":"556_CR40","doi-asserted-by":"crossref","first-page":"026132","DOI":"10.1103\/PhysRevE.72.026132","volume":"72","author":"A Clauset","year":"2005","unstructured":"Clauset, A.: Finding local community structure in networks. Phys. Rev. E 72(2), 026132 (2005)","journal-title":"Phys. Rev. E"},{"key":"556_CR41","first-page":"3","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Natl. Secur. Agency Tech. Rep. 16, 3 (2008)","journal-title":"Natl. Secur. Agency Tech. Rep."},{"key":"556_CR42","doi-asserted-by":"crossref","unstructured":"Conte, A., De Matteis, T., De\u00a0Sensi, D., Grossi, R., Marino, A., Versari, L.: D2k: scalable community detection in massive networks via small-diameter k-plexes. In: SIGKDD, pp. 1272\u20131281 (2018)","DOI":"10.1145\/3219819.3220093"},{"key":"556_CR43","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"issue":"5","key":"556_CR44","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1002\/sam.10133","volume":"4","author":"M Coscia","year":"2011","unstructured":"Coscia, M., Giannotti, F., Pedreschi, D.: A classification for community discovery methods in complex networks. Stat. Anal. Data Min. 4(5), 512\u2013546 (2011)","journal-title":"Stat. Anal. Data Min."},{"key":"556_CR45","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":"556_CR46","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":"556_CR47","doi-asserted-by":"crossref","unstructured":"Danisch\u00a0et al, M.: Listing k-cliques in sparse real-world graphs. In: WWW, pp. 589\u2013598 (2018)","DOI":"10.1145\/3178876.3186125"},{"issue":"09","key":"556_CR48","doi-asserted-by":"crossref","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09), P09008 (2005)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"556_CR49","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J. X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"556_CR50","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/978-981-13-2922-7_6","volume-title":"Big Data","author":"Linlin Ding","year":"2018","unstructured":"Ding, L., Xie, Y., Shan, X., Song, B.: Search of center-core community in large graphs. In: CCF Conference on Big Data, pp. 94\u2013107 (2018)"},{"key":"556_CR51","doi-asserted-by":"crossref","unstructured":"DiTursi, D. J., Ghosh, G., Bogdanov, P.: Local community detection in dynamic networks. arXiv preprint arXiv:1709.04033 (2017)","DOI":"10.1109\/ICDM.2017.103"},{"key":"556_CR52","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-46648-7_10","volume-title":"Graph Drawing","author":"Jubin Edachery","year":"1999","unstructured":"Edachery, J., Sen, A., Brandenburg, F.J.: Graph clustering using distance-k cliques. In: Proceedings of the 7th International Symposium on Graph Drawing, pp. 98\u2013106 (1999)"},{"issue":"4","key":"556_CR53","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.6.4.379","volume":"6","author":"J Elzinga","year":"1972","unstructured":"Elzinga, J., Hearn, D.W.: Geometrical solutions for some minimax location problems. Transp. Sci. 6(4), 379\u2013394 (1972)","journal-title":"Transp. Sci."},{"issue":"19","key":"556_CR54","doi-asserted-by":"crossref","first-page":"7663","DOI":"10.1073\/pnas.1018962108","volume":"108","author":"P Expert","year":"2011","unstructured":"Expert, P., et al.: Uncovering space-independent communities in spatial networks. Proc. Natl. Acad. Sci. USA 108(19), 7663\u20137668 (2011)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1\u20132","key":"556_CR55","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. PVLDB 3(1\u20132), 264\u2013275 (2010)","journal-title":"PVLDB"},{"issue":"12","key":"556_CR56","first-page":"1502","volume":"8","author":"W Fan","year":"2015","unstructured":"Fan, W., Wang, X., Wu, Y., Xu, J.: Association rules with graph patterns. PVLDB 8(12), 1502\u20131513 (2015)","journal-title":"PVLDB"},{"key":"556_CR57","first-page":"1","volume-title":"Mobility Analytics for Spatio-Temporal and Social Data","author":"Yixiang Fang","year":"2017","unstructured":"Fang, Y., Cheng, R.: On attributed community search. In: International Workshop on Mobility Analytics for Spatio-temporal and Social Data, PVLDB, pp. 1\u201321 (2017)"},{"issue":"6","key":"556_CR58","doi-asserted-by":"crossref","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."},{"key":"556_CR59","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, R., Cong, G., Mamoulis, N., Li, Y.: On spatial pattern matching. In: ICDE, pp. 293\u2013304 (2018)","DOI":"10.1109\/ICDE.2018.00035"},{"issue":"6","key":"556_CR60","first-page":"709","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","journal-title":"PVLDB"},{"issue":"12","key":"556_CR61","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB 9(12), 1233\u20131244 (2016)","journal-title":"PVLDB"},{"issue":"12","key":"556_CR62","first-page":"1885","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J., Huang, K.: C-explorer: browsing communities in large graphs. PVLDB 10(12), 1885\u20131888 (2017)","journal-title":"PVLDB"},{"issue":"3","key":"556_CR63","first-page":"785","volume":"28","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Tang, W., Maniu, S., Yang, X.: Scalable algorithms for nearest-neighbor joins on big trajectory data. TKDE 28(3), 785\u2013800 (2016)","journal-title":"TKDE"},{"key":"556_CR64","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, R., Wang, J., Budiman, L., Cong, G., Mamoulis, N.: Spacekey: exploring patterns in spatial databases. In: ICDE, pp. 1577\u20131580 (2018)","DOI":"10.1109\/ICDE.2018.00180"},{"issue":"4","key":"556_CR65","first-page":"783","volume":"31","author":"Y Fang","year":"2019","unstructured":"Fang, Y., Wang, Z., Cheng, R., Li, X., Luo, S., Hu, J., Chen, X.: On spatial-aware community search. TKDE 31(4), 783\u2013798 (2019)","journal-title":"TKDE"},{"key":"556_CR66","doi-asserted-by":"crossref","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. In: TKDE, p. 1 (2018)","DOI":"10.1109\/ICDE.2019.00273"},{"key":"556_CR67","doi-asserted-by":"crossref","unstructured":"Fang, Y., Yu, K., Cheng, R., Lakshmanan, L.V., Lin, X.: Efficient algorithms for densest subgraph discovery. In: PVLDB (2019)","DOI":"10.14778\/3342263.3342645"},{"issue":"5","key":"556_CR68","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1177\/0165551514541614","volume":"40","author":"Y Fang","year":"2014","unstructured":"Fang, Y., Zhang, H., Ye, Y., Li, X.: Detecting hot topics from twitter: a multiview approach. J. Inf. Sci. 40(5), 578\u2013593 (2014)","journal-title":"J. Inf. Sci."},{"key":"556_CR69","unstructured":"Fei Fan, W., Wang, X., Wu, Y.: Expfinder: finding experts by graph pattern matching. In: ICDE, pp. 1316\u20131319. IEEE (2013)"},{"key":"556_CR70","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L. : Efficient identification of web communities. In: SIGKDD, pp. 150\u2013160 (2000)","DOI":"10.1145\/347090.347121"},{"issue":"3","key":"556_CR71","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":"556_CR72","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: STOC, pp. 246\u2013251 (1983)","DOI":"10.1145\/800061.808753"},{"issue":"5","key":"556_CR73","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1007\/s10618-016-0464-z","volume":"30","author":"E Galbrun","year":"2016","unstructured":"Galbrun, E., Gionis, A., Tatti, N.: Top-k overlapping densest subgraphs. Data Min. Knowl. Discov. 30(5), 1134\u20131165 (2016)","journal-title":"Data Min. Knowl. Discov."},{"key":"556_CR74","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"556_CR75","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D. M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. In: ICDM, pp. 201\u2013210 (2011)","DOI":"10.1109\/ICDM.2011.46"},{"key":"556_CR76","volume-title":"Algorithmic Graph Theory","author":"A Gibbons","year":"1985","unstructured":"Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)"},{"issue":"12","key":"556_CR77","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"556_CR78","volume-title":"Finding a Maximum Density Subgraph","author":"AV Goldberg","year":"1984","unstructured":"Goldberg, A.V.: Finding a Maximum Density Subgraph. University of California, Berkeley (1984)"},{"key":"556_CR79","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: SIGMOD, pp. 927\u2013940. ACM (2008)","DOI":"10.1145\/1376616.1376708"},{"key":"556_CR80","first-page":"599","volume":"14","author":"JE Gonzalez","year":"2014","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: Graphx: graph processing in a distributed dataflow framework. OSDI 14, 599\u2013613 (2014)","journal-title":"OSDI"},{"issue":"10","key":"556_CR81","doi-asserted-by":"crossref","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010)","journal-title":"New J. Phys."},{"issue":"7028","key":"556_CR82","doi-asserted-by":"crossref","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"},{"issue":"10","key":"556_CR83","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1002\/bies.20820","volume":"30","author":"N Gulbahce","year":"2008","unstructured":"Gulbahce, N., Lehmann, S.: The art of community detection. BioEssays 30(10), 934\u2013938 (2008)","journal-title":"BioEssays"},{"issue":"7","key":"556_CR84","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1080\/13658810701674970","volume":"22","author":"D Guo","year":"2008","unstructured":"Guo, D.: Regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP). Int. J. Geogr. Inf. Sci. 22(7), 801\u2013823 (2008)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"556_CR85","doi-asserted-by":"crossref","unstructured":"Guo, T., Cao, X., Cong, G.: Efficient algorithms for answering the m-closest keywords query. In: SIGMOD, pp. 405\u2013418 (2015)","DOI":"10.1145\/2723372.2723723"},{"key":"556_CR86","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching, volume\u00a014 (1984)","DOI":"10.1145\/971697.602266"},{"key":"556_CR87","doi-asserted-by":"crossref","unstructured":"Hajibagheri, A., Alvari, H., Hamzeh, A., Hashemi, S.: Community detection in social networks using information diffusion. In: ASONAM, pp. 702\u2013703 (2012)","DOI":"10.1109\/ASONAM.2012.119"},{"issue":"6","key":"556_CR88","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1002\/wics.1319","volume":"6","author":"S Harenberg","year":"2014","unstructured":"Harenberg, S., Bello, G., Gjeltema, L., Ranshous, S., Harlalka, J., Seay, R., Padmanabhan, K., Samatova, N.: Community detection in large-scale networks: a survey and empirical evaluation. Wiley Interdiscip. Rev. Comput. Stat. 6(6), 426\u2013439 (2014)","journal-title":"Wiley Interdiscip. Rev. Comput. Stat."},{"issue":"3","key":"556_CR89","doi-asserted-by":"crossref","first-page":"035102","DOI":"10.1103\/PhysRevE.74.035102","volume":"74","author":"MB Hastings","year":"2006","unstructured":"Hastings, M.B.: Community detection as an inference problem. Phys. Rev. E 74(3), 035102 (2006)","journal-title":"Phys. Rev. E"},{"key":"556_CR90","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P. S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305\u2013316. ACM (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"556_CR91","doi-asserted-by":"crossref","unstructured":"Henderson, K., Eliassi-Rad, T., Papadimitriou, S., Faloutsos, C.: HCDF: a hybrid community discovery framework. In: SDM, pp. 754\u2013765 (2010)","DOI":"10.1137\/1.9781611972801.66"},{"key":"556_CR92","unstructured":"Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms (1983)"},{"key":"556_CR93","doi-asserted-by":"crossref","unstructured":"Hu, J., Cheng, R., Chang, K. C., Sankar, A., Fang, Y., Lam, B.Y.H.: Discovering maximal motif cliques in large heterogeneous information networks. In: ICDE, pp. 746\u2013757 (2019)","DOI":"10.1109\/ICDE.2019.00072"},{"key":"556_CR94","doi-asserted-by":"crossref","unstructured":"Hu, J., Cheng, R., Huang, Z., Fang, Y., Luo, S.: On embedding uncertain graphs. In: CIKM, pp. 157\u2013166. ACM (2017)","DOI":"10.1145\/3132847.3132885"},{"key":"556_CR95","doi-asserted-by":"crossref","unstructured":"Hu, J., Wu, X., Cheng, R., Luo, S., Fang, Y.: Querying minimal Steiner maximum-connected subgraphs in large graphs. In: CIKM, pp. 1241\u20131250 (2016)","DOI":"10.1145\/2983323.2983748"},{"key":"556_CR96","doi-asserted-by":"crossref","unstructured":"Hu, J., Wu, X., Cheng, R., Luo, S., Fang, Y.: On minimal Steiner maximum-connected subgraph queries. In: TKDE, pp. 2455\u20132469 (2017)","DOI":"10.1109\/TKDE.2017.2730873"},{"issue":"4","key":"556_CR97","first-page":"27","volume":"39","author":"X Hu","year":"2014","unstructured":"Hu, X., Tao, Y., Chung, C.-W.: I\/o-efficient algorithms on triangle listing and counting. ACM Trans. Database Syst. (TODS) 39(4), 27 (2014)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"556_CR98","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":"3","key":"556_CR99","first-page":"29","volume":"39","author":"X Huang","year":"2016","unstructured":"Huang, X., Cheng, H., Yu, J.X.: Attributed community analysis: global and ego-centric views. IEEE Data Eng. Bull. 39(3), 29\u201340 (2016)","journal-title":"IEEE Data Eng. Bull."},{"key":"556_CR100","doi-asserted-by":"crossref","unstructured":"Huang, X., Jiang, J., Choi, B., Xu, J., Zhang, Z., Song, Y.: PP-DBLP: modeling and generating attributed public-private networks with DBLP. In: IEEE International Conference on Data Mining Workshops (ICDMW), pp. 986\u2013989 (2018)","DOI":"10.1109\/ICDMW.2018.00142"},{"issue":"4","key":"556_CR101","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":"556_CR102","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":"556_CR103","doi-asserted-by":"crossref","unstructured":"Huang, X., Lakshmanan, L.V.S., Xu, J.: Community search over big graphs: models, algorithms, and opportunities. In: ICDE, pp. 1451\u20131454 (2017)","DOI":"10.1109\/ICDE.2017.211"},{"key":"556_CR104","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.: Truss decomposition of probabilistic graphs: semantics and algorithms. In: SIGMOD, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"issue":"12","key":"556_CR105","first-page":"1940","volume":"8","author":"N Jayaram","year":"2015","unstructured":"Jayaram, N., Goyal, S., Li, C.: VIIQ: auto-suggestion enabled visual interface for interactive graph query formulation. PVLDB 8(12), 1940\u20131943 (2015)","journal-title":"PVLDB"},{"key":"556_CR106","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Huang, X., Cheng, H., Yu, J. X.: VizCS: online searching and visualizing communities in dynamic graphs. In: ICDE, pp. 1585\u20131588 (2018)","DOI":"10.1109\/ICDE.2018.00182"},{"key":"556_CR107","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505\u2013516. VLDB Endowment (2005)"},{"issue":"10","key":"556_CR108","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":"556_CR109","unstructured":"Karypis, G., Kumar, V.: Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. (1995)"},{"key":"556_CR110","unstructured":"Khan, B.S., Niazi, M.A.: Network community detection: a review and visual survey. arXiv:1708.00977 (2017)"},{"issue":"1","key":"556_CR111","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single PC. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"issue":"3","key":"556_CR112","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/2854006.2854013","volume":"44","author":"J Kim","year":"2015","unstructured":"Kim, J., Lee, J.-G.: Community detection in multi-layer graphs: a survey. SIGMOD Rec. 44(3), 37\u201348 (2015)","journal-title":"SIGMOD Rec."},{"issue":"1","key":"556_CR113","doi-asserted-by":"crossref","first-page":"016103","DOI":"10.1103\/PhysRevE.81.016103","volume":"81","author":"Y Kim","year":"2010","unstructured":"Kim, Y., Son, S.-W., Jeong, H.: Finding communities in directed networks. Phys. Rev. E 81(1), 016103 (2010)","journal-title":"Phys. Rev. E"},{"key":"556_CR114","doi-asserted-by":"crossref","unstructured":"Kloumann, I.M., Kleinberg, J.M.: Community membership identification from small seed sets. In: SIGKDD, pp. 1366\u20131375 (2014)","DOI":"10.1145\/2623330.2623621"},{"issue":"2","key":"556_CR115","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Inf. 15(2), 141\u2013145 (1981)","journal-title":"Acta Inf."},{"key":"556_CR116","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-319-71970-2_12","volume-title":"Personal Analytics and Privacy. An Individual and Collective Perspective","author":"Zhana Kuncheva","year":"2017","unstructured":"Kuncheva, Z., Montana, G.: Multi-scale community detection in temporal networks using spectral graph wavelets. In: International Workshop on Personal Analytics and Privacy, pp. 139\u2013154 (2017)"},{"issue":"10","key":"556_CR117","first-page":"974","volume":"8","author":"L Lai","year":"2015","unstructured":"Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce. PVLDB 8(10), 974\u2013985 (2015)","journal-title":"PVLDB"},{"issue":"3","key":"556_CR118","first-page":"217","volume":"10","author":"L Lai","year":"2016","unstructured":"Lai, L., Qin, L., Lin, X., Zhang, Y., Chang, L., Yang, S.: Scalable distributed subgraph enumeration. PVLDB 10(3), 217\u2013228 (2016)","journal-title":"PVLDB"},{"issue":"1","key":"556_CR119","doi-asserted-by":"crossref","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"556_CR120","first-page":"340","volume":"27","author":"J Lee","year":"2015","unstructured":"Lee, J., Chung, C.: A query approach for influence maximization on specific users in social networks. TKDE 27(2), 340\u2013353 (2015)","journal-title":"TKDE"},{"issue":"11","key":"556_CR121","doi-asserted-by":"crossref","first-page":"118703","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"EA Leicht","year":"2008","unstructured":"Leicht, E.A., Newman, M.E.: Community structure in directed networks. Phys. Rev. Lett. 100(11), 118703 (2008)","journal-title":"Phys. Rev. Lett."},{"key":"556_CR122","doi-asserted-by":"crossref","unstructured":"Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: FOCS, pp. 422\u2013431 (1988)","DOI":"10.21236\/ADA211908"},{"key":"556_CR123","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network community detection. In: WWW, pp. 631\u2013640 (2010)","DOI":"10.1145\/1772690.1772755"},{"key":"556_CR124","doi-asserted-by":"crossref","unstructured":"Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: SIGMOD, pp. 903\u2013914. ACM (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"556_CR125","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, X., Deng, K., Yang, X., Sellis, T., Yu, J.X.: Most influential community search over large social networks. In: ICDE, pp. 871\u2013882 (2017)","DOI":"10.1109\/ICDE.2017.136"},{"key":"556_CR126","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Qin, L., Ye, F., Yu, J. X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: SIGMOD, pp. 457\u2013472 (2018)","DOI":"10.1145\/3183713.3183736"},{"issue":"5","key":"556_CR127","first-page":"509","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"issue":"6","key":"556_CR128","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s00778-017-0467-4","volume":"26","author":"R-H Li","year":"2017","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Finding influential communities in massive networks. VLDB J. 26(6), 751\u2013776 (2017)","journal-title":"VLDB J."},{"key":"556_CR129","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Su, J., Qin, L., Yu, J. X., Dai, Q.: Persistent community search in temporal networks. In: ICDE, pp. 797\u2013808 (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"issue":"10","key":"556_CR130","first-page":"2453","volume":"26","author":"R-H Li","year":"2014","unstructured":"Li, R.-H., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. TKDE 26(10), 2453\u20132465 (2014)","journal-title":"TKDE"},{"key":"556_CR131","unstructured":"Li, X., Cheng, R., Fang, Y., Hu, J., Maniu, S.: Scalable evaluation of k-NN queries on large uncertain graphs. In: EDBT, pp. 181\u2013192 (2018)"},{"key":"556_CR132","doi-asserted-by":"crossref","unstructured":"Li, Y., Sha, C., Huang, X., Zhang, Y.: Community detection in attributed graphs: an embedding approach. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11274"},{"issue":"1","key":"556_CR133","first-page":"24","volume":"9","author":"Z Li","year":"2015","unstructured":"Li, Z., Fang, Y., Liu, Q., Cheng, J., Cheng, R., Lui, J.: Walking in the cloud: parallel SimRank at scale. PVLDB 9(1), 24\u201335 (2015)","journal-title":"PVLDB"},{"key":"556_CR134","doi-asserted-by":"crossref","unstructured":"Liu, S., Wang, S., Krishnan, R.: Persistent community detection in dynamic social networks. In: PAKDD, pp. 78\u201389 (2014)","DOI":"10.1007\/978-3-319-06608-0_7"},{"key":"556_CR135","doi-asserted-by":"crossref","unstructured":"Liu, Y., Niculescu-Mizil, A., Gryc, W.: Topic-link LDA: joint models of topic and author community. In: International Conference on Machine Learning, pp. 665\u2013672 (2009)","DOI":"10.1145\/1553374.1553460"},{"key":"556_CR136","doi-asserted-by":"crossref","unstructured":"Luo, F., Wang, J.Z., Promislow, E.: Exploring local community structures in large networks. In: ICWI, pp. 233\u2013239 (2006)","DOI":"10.1109\/WI.2006.72"},{"issue":"1\u20132","key":"556_CR137","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":"556_CR138","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M. H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"4","key":"556_CR139","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.physrep.2013.08.002","volume":"533","author":"FD Malliaros","year":"2013","unstructured":"Malliaros, F.D., Vazirgiannis, M.: Clustering and community detection in directed networks: a survey. Phys. Rep. 533(4), 95\u2013142 (2013)","journal-title":"Phys. Rep."},{"key":"556_CR140","unstructured":"Marcel, P., Negre, E.: A survey of query recommendation techniques for data warehouse exploration. In: EDA, pp. 119\u2013134 (2011)"},{"issue":"2","key":"556_CR141","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":"2","key":"556_CR142","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1514888.1514890","volume":"3","author":"A Mehler","year":"2009","unstructured":"Mehler, A., Skiena, S.: Expanding network communities from representative examples. TKDD 3(2), 7 (2009)","journal-title":"TKDD"},{"key":"556_CR143","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation algorithm for the steiner problem in graphs. Inf. Process. Lett. 27, 125\u2013128 (1988)","journal-title":"Inf. Process. Lett."},{"key":"556_CR144","doi-asserted-by":"crossref","unstructured":"Meng, T., Cai, L., He, T., Chen, L., Deng, Z.: K-hop community search based on local distance dynamics. KSII Trans. Internet Inf. Syst. 12(7) (2018)","DOI":"10.3837\/tiis.2018.07.005"},{"issue":"2","key":"556_CR145","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed k-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"556_CR146","doi-asserted-by":"crossref","unstructured":"Moradi, F., Olovsson, T., Tsigas, P.: A local seed selection algorithm for overlapping community detection. In: ASONAM, pp. 1\u20138 (2014)","DOI":"10.1109\/ASONAM.2014.6921552"},{"key":"556_CR147","doi-asserted-by":"crossref","unstructured":"Nallapati, R.M., Ahmed, A., Xing, E.P., Cohen, W.W.: Joint latent topic models for text and citations. In: SIGKDD, pp. 542\u2013550 (2008)","DOI":"10.1145\/1401890.1401957"},{"issue":"6","key":"556_CR148","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"556_CR149","doi-asserted-by":"crossref","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"},{"key":"556_CR150","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.physa.2016.01.101","volume":"452","author":"X Ning","year":"2016","unstructured":"Ning, X., Liu, Z., Zhang, S.: Local community extraction in directed networks. Phys. A Stat. Mech. Appl. 452, 258\u2013265 (2016)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"556_CR151","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, 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"3","key":"556_CR152","first-page":"515","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. DMKD 24(3), 515\u2013554 (2012)","journal-title":"DMKD"},{"key":"556_CR153","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Myaeng, S.-H., Kang, U.: Pte: enumerating trillion triangles on distributed systems. In: SIGKDD, pp. 1115\u20131124. ACM (2016)","DOI":"10.1145\/2939672.2939757"},{"key":"556_CR154","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-1-4419-8462-3_4","volume-title":"Social Network Data Analytics","author":"S. Parthasarathy","year":"2011","unstructured":"Parthasarathy, S., Ruan, Y., Satuluri, V.: Community discovery in social networks: applications, methods and emerging trends. In: Social Network Data Analytics, pp. 79\u2013113 (2011)"},{"key":"556_CR155","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: SIGKDD, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"556_CR156","first-page":"65","volume-title":"Computer Communications and Networks","author":"Michel Planti\u00e9","year":"2012","unstructured":"Planti\u00e9, M., Crampes, M.: Survey on social community detection. In: Social Media Retrieval, pp. 65\u201385 (2013)"},{"key":"556_CR157","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/11569596_31","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"Pascal Pons","year":"2005","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: International Symposium on Computer and Information Sciences, pp. 284\u2013293 (2005)"},{"issue":"9","key":"556_CR158","first-page":"1082","volume":"56","author":"MA Porter","year":"2009","unstructured":"Porter, M.A., Onnela, J.-P., Mucha, P.J.: Communities in networks. Not. AMS 56(9), 1082\u20131097 (2009)","journal-title":"Not. AMS"},{"key":"556_CR159","doi-asserted-by":"crossref","unstructured":"Qi, G.-J., Aggarwal, C.C., Huang, T.S.: Online community detection in social sensing. In: WSDM, pp. 617\u2013626 (2013)","DOI":"10.1145\/2433396.2433474"},{"issue":"2","key":"556_CR160","doi-asserted-by":"crossref","first-page":"176","DOI":"10.14778\/3149193.3149198","volume":"11","author":"M Qiao","year":"2017","unstructured":"Qiao, M., Zhang, H., Cheng, H.: Subgraph matching: on compression and computation. Proc. VLDB Endow. 11(2), 176\u2013188 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"556_CR161","doi-asserted-by":"crossref","unstructured":"Qin, L., Li, R.-H., Chang, L., Zhang, C.: Locally densest subgraph discovery. In: SIGKDD, pp. 965\u2013974 (2015)","DOI":"10.1145\/2783258.2783299"},{"key":"556_CR162","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J. X., Chang, L., Tao, Y.: Querying communities in relational databases. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.67"},{"issue":"2","key":"556_CR163","doi-asserted-by":"crossref","first-page":"35:1","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Comput. Surv. 51(2), 35:1\u201335:37 (2018)","journal-title":"ACM Comput. Surv."},{"key":"556_CR164","doi-asserted-by":"crossref","unstructured":"Ruan, Y., Fuhry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: WWW, pp. 1089\u20131098 (2013)","DOI":"10.1145\/2488388.2488483"},{"key":"556_CR165","doi-asserted-by":"crossref","unstructured":"Sachan, M., Contractor, D., Faruquie, T.A., Subramaniam, L.V.: Using content and interactions for discovering communities in social networks. In: WWW, pp. 331\u2013340 (2012)","DOI":"10.1145\/2187836.2187882"},{"issue":"11","key":"556_CR166","doi-asserted-by":"crossref","first-page":"3304","DOI":"10.1093\/ietfec\/e91-a.11.3304","volume":"91","author":"K Saito","year":"2008","unstructured":"Saito, K., Yamada, T., Kazama, K.: Extracting communities from complex networks by the k-dense method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91(11), 3304\u20133311 (2008)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"3","key":"556_CR167","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s00778-016-0423-8","volume":"25","author":"AE Sar\u0131y\u00fcce","year":"2016","unstructured":"Sar\u0131y\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Incremental k-core decomposition: algorithms and evaluation. VLDB J. 25(3), 425\u2013447 (2016)","journal-title":"VLDB J."},{"issue":"3","key":"556_CR168","first-page":"97","volume":"10","author":"AE Sariy\u00fcce","year":"2016","unstructured":"Sariy\u00fcce, A.E., Pinar, A.: Fast hierarchy construction for dense subgraphs. PVLDB 10(3), 97\u2013108 (2016)","journal-title":"PVLDB"},{"key":"556_CR169","doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Seshadhri, C., Pinar, A., Catalyurek, U.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: WWW, pp. 927\u2013937 (2015)","DOI":"10.2172\/1172917"},{"issue":"3","key":"556_CR170","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":"1","key":"556_CR171","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"key":"556_CR172","doi-asserted-by":"crossref","unstructured":"Shakarian, P., Roos, P., Callahan, D., Kirk, C.: Mining for geographically disperse communities in social networks by leveraging distance modularity. In: SIGKDD, pp. 1402\u20131409 (2013)","DOI":"10.21236\/ADA590262"},{"key":"556_CR173","doi-asserted-by":"crossref","unstructured":"Shang, J., Wang, C., Wang, C., Guo, G., Qian, J.: An attribute-based community search method with graph refining. J. Supercomput. 1\u201328 (2017)","DOI":"10.1007\/s11227-017-1976-z"},{"issue":"1","key":"556_CR174","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TKDE.2016.2598561","volume":"29","author":"C Shi","year":"2017","unstructured":"Shi, C., Li, Y., Zhang, J., Sun, Y., Philip, S.Y.: A survey of heterogeneous information network analysis. IEEE Trans. Knowl. Data Eng. 29(1), 17\u201337 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"556_CR175","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"},{"key":"556_CR176","doi-asserted-by":"crossref","unstructured":"Subbian, K., Aggarwal, C.C., Srivastava, J., Yu, P.S.: Community detection with prior knowledge. In: SDM, pp. 405\u2013413 (2013)","DOI":"10.1137\/1.9781611972832.45"},{"key":"556_CR177","doi-asserted-by":"crossref","unstructured":"Tamimi, I., El\u00a0Kamili, M.: Literature survey on dynamic community detection and models of social networks. In: International Conference on Wireless Networks and Mobile Communications, pp. 1\u20135 (2015)","DOI":"10.1109\/WINCOM.2015.7381332"},{"key":"556_CR178","doi-asserted-by":"crossref","unstructured":"Tang, L., Liu, H.: Scalable learning of collective behavior based on sparse social dimensions. In: CIKM, pp. 1107\u20131116 (2009)","DOI":"10.1145\/1645953.1646094"},{"key":"556_CR179","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: KDD, pp. 737\u2013746. ACM (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"556_CR180","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: SIGKDD, pp. 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"},{"issue":"1","key":"556_CR181","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM (JACM) 23(1), 31\u201342 (1976)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"556_CR182","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"556_CR183","doi-asserted-by":"crossref","unstructured":"Wang, H., Aggarwal, C.C.: A survey of algorithms for keyword search on graph data. In: Managing and Mining Graph Data, pp. 249\u2013273. Springer (2010)","DOI":"10.1007\/978-1-4419-6045-0_8"},{"issue":"9","key":"556_CR184","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":"556_CR185","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: ICDE, pp. 233\u2013244 (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"issue":"2","key":"556_CR186","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":"4","key":"556_CR187","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s41019-017-0051-3","volume":"2","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Jian, X., Yang, Z., Li, J.: Query optimal k-plex based community in graphs. Data Sci. Eng. 2(4), 257\u2013273 (2017)","journal-title":"Data Sci. Eng."},{"issue":"1","key":"556_CR188","doi-asserted-by":"crossref","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. Data Eng. 31(1), 75\u201390 (2019)","journal-title":"IEEE Trans. Data Eng."},{"issue":"1","key":"556_CR189","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1103\/RevModPhys.54.235","volume":"54","author":"F-Y Wu","year":"1982","unstructured":"Wu, F.-Y.: The potts model. Rev. Mod. Phys. 54(1), 235 (1982)","journal-title":"Rev. Mod. Phys."},{"issue":"7","key":"556_CR190","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":"556_CR191","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":"556_CR192","doi-asserted-by":"crossref","unstructured":"Xu, Z., Ke, Y., Wang, Y., Cheng, H., Cheng, J.: A model-based approach to attributed graph clustering. In: SIGMOD, pp. 505\u2013516 (2012)","DOI":"10.1145\/2213836.2213894"},{"issue":"10","key":"556_CR193","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","volume":"19","author":"B Yang","year":"2007","unstructured":"Yang, B., Cheung, W., Liu, J.: Community mining from signed social networks. IEEE Trans. Knowl. Data Eng. 19(10), 1333\u20131348 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"556_CR194","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-1-4419-7142-5_16","volume-title":"Handbook of Social Network Technologies and Applications","author":"Bo Yang","year":"2010","unstructured":"Yang, B., Liu, D., Liu, J.: Discovering communities from social networks: methodologies and applications, pp. 331\u2013346 (2010)"},{"issue":"6","key":"556_CR195","first-page":"397","volume":"4","author":"D-N Yang","year":"2011","unstructured":"Yang, D.-N., Chen, Y.-L., Lee, W.-C., Chen, M.-S.: On social\u2013temporal group query with acquaintance constraint. PVLDB 4(6), 397\u2013408 (2011)","journal-title":"PVLDB"},{"key":"556_CR196","doi-asserted-by":"crossref","unstructured":"Yang, D.-N., Shen, C.-Y., Lee, W.-C., Chen, M.-S.: On socio-spatial group query for location-based social networks. In: SIGKDD, pp. 949\u2013957 (2012)","DOI":"10.1145\/2339530.2339679"},{"issue":"1","key":"556_CR197","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"556_CR198","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: ICDM, pp. 1151\u20131156 (2013)","DOI":"10.1109\/ICDM.2013.167"},{"key":"556_CR199","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., Leskovec, J.: Detecting cohesive and 2-mode communities indirected and undirected networks. In: WSDM, pp. 323\u2013332 (2014)","DOI":"10.1145\/2556195.2556243"},{"key":"556_CR200","unstructured":"Yang, L., Cao, X., He, D., Wang, C., Wang, X., Zhang, W.: Modularity based community detection with deep learning. In: IJCAI, pp. 2252\u20132258 (2016)"},{"key":"556_CR201","doi-asserted-by":"crossref","unstructured":"Yang, T., Chi, Y., Zhu, S., Gong, Y., Jin, R.: Directed network community detection: a popularity and productivity link model. In: SDM, pp. 742\u2013753 (2010)","DOI":"10.1137\/1.9781611972801.65"},{"key":"556_CR202","doi-asserted-by":"crossref","unstructured":"Yang, T., Jin, R., Chi, Y., Zhu, S.: Combining link and content for community detection: a discriminative approach. In: SIGKDD, pp. 927\u2013936 (2009)","DOI":"10.1145\/1557019.1557120"},{"issue":"3","key":"556_CR203","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s00778-017-0454-9","volume":"26","author":"P Yi","year":"2017","unstructured":"Yi, P., Choi, B., Bhowmick, S.S., Xu, J.: AutoG: a visual query autocompletion framework for graph databases. VLDB J. 26(3), 347\u2013372 (2017)","journal-title":"VLDB J."},{"issue":"1","key":"556_CR204","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00231ED1V01Y200912DTM001","volume":"1","author":"Jeffrey Xu Yu","year":"2009","unstructured":"Yu, J.X., Qin, L., Chang, L.: Keyword Search in Databases. Synthesis Lectures on Data Management (2009)","journal-title":"Synthesis Lectures on Data Management"},{"issue":"5","key":"556_CR205","first-page":"922","volume":"30","author":"L Yuan","year":"2018","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. TKDE 30(5), 922\u2013935 (2018)","journal-title":"TKDE"},{"issue":"6","key":"556_CR206","first-page":"1212","volume":"29","author":"Y Yuan","year":"2017","unstructured":"Yuan, Y., Lian, X., Chen, L., Yu, J.X., Wang, G., Sun, Y.: Keyword search over distributed graphs with compressed signature. TKDE 29(6), 1212\u20131225 (2017)","journal-title":"TKDE"},{"issue":"9","key":"556_CR207","first-page":"800","volume":"5","author":"Y Yuan","year":"2012","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient subgraph similarity search on large probabilistic graph databases. PVLDB 5(9), 800\u2013811 (2012)","journal-title":"PVLDB"},{"issue":"12","key":"556_CR208","first-page":"2767","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. TKDE 25(12), 2767\u20132779 (2013)","journal-title":"TKDE"},{"issue":"11","key":"556_CR209","first-page":"876","volume":"4","author":"Y Yuan","year":"2011","unstructured":"Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. PVLDB 4(11), 876\u2013886 (2011)","journal-title":"PVLDB"},{"key":"556_CR210","doi-asserted-by":"crossref","unstructured":"Zhang, F., Yuan, L., Zhang, Y., Qin, L., Lin, X., Zhou, A.: Discovering strong communities with user engagement and tie strength. In: DASFAA, pp. 425\u2013441 (2018)","DOI":"10.1007\/978-3-319-91452-7_28"},{"issue":"10","key":"556_CR211","first-page":"998","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: When engagement meets similarity: efficient (k, r)-core computation on social networks. PVLDB 10(10), 998\u20131009 (2017)","journal-title":"PVLDB"},{"key":"556_CR212","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":"556_CR213","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J. X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: ICDE, pp. 337\u2013348 (2017)","DOI":"10.1109\/ICDE.2017.93"},{"key":"556_CR214","first-page":"85","volume":"6","author":"F Zhao","year":"2012","unstructured":"Zhao, F., Tung, A.K.: Large scale cohesive subgraphs discovery for social network visual analysis. PVLDB 6, 85\u201396 (2012)","journal-title":"PVLDB"},{"key":"556_CR215","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 International Conference on Semantic Computing, pp. 156\u2013163. IEEE (2017)","DOI":"10.1109\/ICSC.2017.80"},{"issue":"C","key":"556_CR216","doi-asserted-by":"crossref","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(C), 344\u2013360 (2017)","journal-title":"Inf. Sci."},{"key":"556_CR217","doi-asserted-by":"crossref","unstructured":"Zhou, D., Councill, I., Zha, H., Giles, C.L.: Discovering temporal communities from social network documents. In: ICDM, pp. 745\u2013750 (2007)","DOI":"10.1109\/ICDM.2007.56"},{"key":"556_CR218","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"},{"key":"556_CR219","unstructured":"Zhou, R., Liu, C., Yu, J. X., Liang, W., Zhang, Y.: Efficient truss maintenance in evolving networks. arXiv preprint arXiv:1402.2807 (2014)"},{"issue":"1","key":"556_CR220","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"},{"issue":"5","key":"556_CR221","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s00778-017-0473-6","volume":"26","author":"Q Zhu","year":"2017","unstructured":"Zhu, Q., Hu, H., Xu, C., Xu, J., Lee, W.-C.: Geo-social group queries with minimum acquaintance constraints. VLDB J. 26(5), 709\u2013727 (2017)","journal-title":"VLDB J."},{"key":"556_CR222","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: Diversified coherent core search on multi-layer graphs. In: ICDE, pp. 701\u2013712. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00069"},{"issue":"1","key":"556_CR223","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: Distance-join: pattern match query in a large graph database. PVLDB 2(1), 886\u2013897 (2009)","journal-title":"PVLDB"}],"updated-by":[{"DOI":"10.1007\/s00778-019-00592-7","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000}}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00556-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00556-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00556-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T08:55:46Z","timestamp":1664009746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00556-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,20]]},"references-count":223,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00556-x","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s00778-019-00592-7","asserted-by":"object"}]},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,20]]},"assertion":[{"value":"31 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2019","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"In the original article, the Table\ufffd\ufffd1 was published with incorrect figures. The correct Table\ufffd\ufffd1 is given below","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}