{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T04:50:28Z","timestamp":1749185428144,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11280-021-00904-4","type":"journal-article","created":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T13:03:17Z","timestamp":1623416597000},"page":"655-677","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The art of characterization in large networks: Finding the critical attributes"],"prefix":"10.1007","volume":"25","author":[{"given":"Renjie","family":"Sun","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3908-6545","authenticated-orcid":false,"given":"Chen","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yanping","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Mengqi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xijuan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,11]]},"reference":[{"key":"904_CR1","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv:cs\/0310049 (2003)"},{"key":"904_CR2","doi-asserted-by":"crossref","unstructured":"Cali\u00f2, A., Tagarelli, A., Bonchi, F.: Cores matter? an analysis of graph decomposition effects on influence maximization problems. In: ACM Conference on Web Science, pp. 184\u2013193 (2020)","DOI":"10.1145\/3394231.3397908"},{"key":"904_CR3","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. VLDB (2016)","DOI":"10.14778\/2994509.2994538"},{"key":"904_CR4","doi-asserted-by":"crossref","unstructured":"Guan, S., Ma, H., Wu, Y.: Attribute-Driven Backbone Discovery. In: KDD, pp. 187\u2013195 (2019)","DOI":"10.1145\/3292500.3330934"},{"key":"904_CR5","doi-asserted-by":"crossref","unstructured":"Huang, X., Lakshmanan, L.V.S.: Attribute-driven community search. PVLDB (2017)","DOI":"10.14778\/3099622.3099626"},{"key":"904_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp 85\u2013103. Springer (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"904_CR7","doi-asserted-by":"crossref","unstructured":"Lee, J., Park, K., Prabhakar, S.: Mining statistically significant attribute associations in attributed graphs. In: ICDM, pp. 991\u2013996 (2016)","DOI":"10.1109\/ICDM.2016.0125"},{"issue":"5","key":"904_CR8","first-page":"509","volume":"8","author":"RH 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"},{"key":"904_CR9","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhu, Y., Zhao, M., Huang, X., Xu, J., Gao, Y.: Vac: Vertex-Centric Attributed Community Search. In: ICDE, pp. 937\u2013948 (2020)","DOI":"10.1109\/ICDE48307.2020.00086"},{"key":"904_CR10","doi-asserted-by":"crossref","unstructured":"Pfeiffer, J.J. III, Moreno, S., La Fond, T., Neville, J., Gallagher, B.: Attributed graph models: Modeling network structure with correlated attributes. In: WWW, pp. 831\u2013842 (2014)","DOI":"10.1145\/2566486.2567993"},{"key":"904_CR11","doi-asserted-by":"crossref","unstructured":"Qi, G.J., Aggarwal, C.C., Huang, T.: Community detection with edge content in social media networks. In: ICDE, pp. 534\u2013545 (2012)","DOI":"10.1109\/ICDE.2012.77"},{"key":"904_CR12","doi-asserted-by":"crossref","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Networks (1983)","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"904_CR13","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. TKDE (2020)","DOI":"10.1109\/TKDE.2020.3047224"},{"key":"904_CR14","doi-asserted-by":"crossref","unstructured":"Sun, R., Zhu, Q., Chen, C., Wang, X., Zhang, Y., Wang, X.: Discovering cliques in signed networks based on balance theory. In: DASFAA, pp. 666\u2013674 (2020)","DOI":"10.1007\/978-3-030-59416-9_43"},{"issue":"3","key":"904_CR15","first-page":"599","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. TKDE 29(3), 599\u2013612 (2016)","journal-title":"TKDE"},{"issue":"2","key":"904_CR16","first-page":"243","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Chen, C.: Bring order into the samples: A novel scalable method for influence maximization. TKDE 29(2), 243\u2013256 (2016)","journal-title":"TKDE"},{"key":"904_CR17","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"},{"issue":"10","key":"904_CR18","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":"904_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, J., Sun, R., Zhu, Q., Wang, X., Chen, C.: Community Identification in Signed Networks: a K-Truss Based Model. In: CIKM, pp. 2321\u20132324 (2020)","DOI":"10.1145\/3340531.3412117"},{"key":"904_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. VLDB (2009)","DOI":"10.14778\/1687627.1687709"},{"issue":"4","key":"904_CR21","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00778-019-00542-3","volume":"28","author":"R Zhu","year":"2019","unstructured":"Zhu, R., Zou, Z., Li, J.: Fast diversified coherent core search on multi-layer graphs. VLDB J. 28(4), 597\u2013622 (2019)","journal-title":"VLDB J."},{"key":"904_CR22","doi-asserted-by":"crossref","unstructured":"Zhu, W., Zhang, M., Chen, C., Wang, X., Zhang, F., Lin, X.: Pivotal relationship identification: The K-Truss minimization problem. In: IJCAI, pp. 4874\u20134880 (2019)","DOI":"10.24963\/ijcai.2019\/677"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00904-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00904-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00904-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T11:17:41Z","timestamp":1646133461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00904-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,11]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["904"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00904-4","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2021,6,11]]},"assertion":[{"value":"18 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}