{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:14:34Z","timestamp":1759335274293,"version":"3.37.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030416713"},{"type":"electronic","value":"9783030416720"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41672-0_12","type":"book-chapter","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T02:03:04Z","timestamp":1582164184000},"page":"205-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Core Decomposition, Maintenance and Applications"],"prefix":"10.1007","author":[{"given":"Feiteng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8958-3999","authenticated-orcid":false,"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","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":"12_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. In: The Computing Research Repository (CoRR). \narXiv:cs.DS\/0310049\n\n (2003)"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., Zaver\u0161nik, 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":"12_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: 27th International Conference on Data Engineering (ICDE), pp. 51\u201362. IEEE, Hannover (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"8","key":"12_CR5","doi-asserted-by":"publisher","first-page":"083030","DOI":"10.1088\/1367-2630\/14\/8\/083030","volume":"14","author":"A Garas","year":"2012","unstructured":"Garas, A., Schweitzer, F., Havlin, S.: A k-shell decomposition method for weighted networks. New J. Phys. 14(8), 083030 (2012)","journal-title":"New J. Phys."},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2012","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed k-core decomposition. Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2012)","journal-title":"Trans. Parallel Distrib. Syst."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Jakma, P., Orczyk, M., Perkins, C.S., Fayed, M.: Distributed k-core decomposition of dynamic graphs. In: Proceedings of the 2012 ACM Conference on CoNEXT Student Workshop, pp. 39\u201340. ACM, Nice (2012)","DOI":"10.1145\/2413247.2413272"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/2850469.2850471","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. Proc. VLDB Endow. 9(1), 13\u201323 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Govindan, P., Wang, C., Xu, C., Duan, H., Soundarajan, S.: The k-peak decomposition: mapping the global structure of graphs. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1441\u20131450. International World Wide Web Conferences Steering Committee, Perth (2017)","DOI":"10.1145\/3038912.3052635"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Mandal, A., Al Hasan, M.: A distributed k-core decomposition algorithm on spark. In: 2017 IEEE International Conference on Big Data (Big Data), pp. 976\u2013981. IEEE, Boston (2017)","DOI":"10.1109\/BigData.2017.8258018"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1316\u20131325. ACM, New York (2014)","DOI":"10.1145\/2623330.2623655"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Peng, Y., Zhang, Y., Zhang, W., Lin, X., Qin, L.: Efficient probabilistic k-core computation on uncertain graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 1192\u20131203. IEEE, Paris (2018)","DOI":"10.1109\/ICDE.2018.00110"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Tripathy, A., Hohman, F., Chau, D.H., Green, O.: Scalable K-core decomposition for static graphs using a dynamic graph data structure. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 1134\u20131141. IEEE, Seattle (2018)","DOI":"10.1109\/BigData.2018.8622056"},{"key":"12_CR14","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: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 133\u2013144. IEEE, Helsinki (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TKDE.2018.2833070","volume":"31","author":"D Wen","year":"2018","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/O efficient core graph decomposition: application to degeneracy ordering. IEEE Trans. Knowl. Data Eng. 31(1), 75\u201390 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"12_CR16","doi-asserted-by":"publisher","first-page":"433","DOI":"10.14778\/2536336.2536344","volume":"6","author":"AE Sar\u0131y\u00fcce","year":"2013","unstructured":"Sar\u0131y\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.L., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. Proc. VLDB Endow. 6(6), 433\u2013444 (2013)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","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. Int. J. Very Large Data Bases 25(3), 425\u2013447 (2016)","journal-title":"VLDB J. Int. J. Very Large Data Bases"},{"issue":"10","key":"12_CR18","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"RH Li","year":"2013","unstructured":"Li, R.H., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. IEEE Trans. Knowl. Data Eng. 26(10), 2453\u20132465 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"12_CR19","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1109\/TKDE.2013.2297918","volume":"26","author":"H Aksu","year":"2014","unstructured":"Aksu, H., Canim, M., Chang, Y.C., Korpeoglu, I., Ulusoy, \u00d6.: Distributed k-core view materialization and maintenance for large dynamic graphs. IEEE Trans. Knowl. Data Eng. 26(10), 2439\u20132452 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Aridhi, S., Brugnara, M., Montresor, A., Velegrakis, Y.: Distributed k-core decomposition and maintenance in large dynamic graphs. In: Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems, pp. 161\u2013168. ACM, Irvine (2016)","DOI":"10.1145\/2933267.2933299"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 337\u2013348. IEEE, San Diego (2017)","DOI":"10.1109\/ICDE.2017.93"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Wang, N., Yu, D., Jin, H., Qian, C., Xie, X., Hua, Q.S.: Parallel algorithm for core maintenance in dynamic graphs. In: 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), pp. 2366\u20132371. IEEE, Atlanta (2017)","DOI":"10.1109\/ICDCS.2017.288"},{"issue":"11","key":"12_CR23","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1109\/TPDS.2018.2835441","volume":"29","author":"H Jin","year":"2018","unstructured":"Jin, H., Wang, N., Yu, D., Hua, Q.S., Shi, X., Xie, X.: Core maintenance in dynamic graphs: a parallel approach based on matching. IEEE Trans. Parallel Distrib. Syst. 29(11), 2416\u20132428 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"12_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-7131-2_110176","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"F Bonchi","year":"2018","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A.: Core Decomposition of Massive, Information-Rich Graphs. In: Alhajj, R., Rokne, J. (eds.) Encyclopedia of Social Network Analysis and Mining. Springer, New York (2018). \nhttps:\/\/doi.org\/10.1007\/978-1-4939-7131-2_110176"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-91452-7_12","volume-title":"Database Systems for Advanced Applications","author":"L Yue","year":"2018","unstructured":"Yue, L., Wen, D., Cui, L., Qin, L., Zheng, Y.: K-connected cores computation in large dual networks. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10827, pp. 169\u2013186. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91452-7_12"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 233\u2013244. IEEE, Paris (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"issue":"10","key":"12_CR27","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/3115404.3115406","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. Proc. VLDB Endow. 10(10), 998\u20131009 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Laishram, R., Sariy\u00fcce, A.E., Eliassi-Rad, T., Pinar, A., Soundarajan, S.: Measuring and improving the core resilience of networks. In: Proceedings of the 2018 World Wide Web Conference, pp. 609\u2013618. International World Wide Web Conferences Steering Committee, Lyon (2018)","DOI":"10.1145\/3178876.3186127"},{"issue":"6","key":"12_CR29","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s00778-017-0467-4","volume":"26","author":"RH Li","year":"2017","unstructured":"Li, R.H., Qin, L., Yu, J.X., Mao, R.: Finding influential communities in massive networks. VLDB J. Int. J. Very Large Data Bases 26(6), 751\u2013776 (2017)","journal-title":"VLDB J. Int. J. Very Large Data Bases"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","volume":"395","author":"J Bae","year":"2014","unstructured":"Bae, J., Kim, S.: Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Phys. A Stat. Mech. Appl. 395, 549\u2013559 (2014)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Rossi, M.E.G., Malliaros, F.D., Vazirgiannis, M.: Spread it good, spread it fast: identification of influential nodes in social networks. In: Proceedings of the 24th International Conference on World Wide Web, pp. 101\u2013102. ACM, Florence (2015)","DOI":"10.1145\/2740908.2742736"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Alduaiji, N., Datta, A.: An empirical study on sentiments in twitter communities. In: 2018 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 1166\u20131172. IEEE, Singapore (2018)","DOI":"10.1109\/ICDMW.2018.00167"},{"issue":"5","key":"12_CR33","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. Data Min. Knowl. Disc. 29(5), 1406\u20131433 (2015)","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"12_CR34","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Min. Knowl. Disc. 24(3), 515\u2013554 (2012)","journal-title":"Data Min. Knowl. Disc."},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Nasir, M.A.U., Gionis, A., Morales, G.D.F., Girdzijauskas, S.: Fully dynamic algorithm for top-k densest subgraphs. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1817\u20131826. ACM, Singapore (2017)","DOI":"10.1145\/3132847.3132966"},{"key":"12_CR36","doi-asserted-by":"publisher","unstructured":"Qu, Y., et al.: Using K-core decomposition on class dependency networks to improve bug prediction model\u2019s practical performance. IEEE Trans. Softw. Eng. 1 (2019). \nhttps:\/\/doi.org\/10.1109\/TSE.2019.2892959","DOI":"10.1109\/TSE.2019.2892959"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Lu, C., Wang, N.: Local k-core clustering for gene networks. In: 2013 IEEE International Conference on Bioinformatics and Biomedicine, pp. 9\u201315. IEEE, Shanghai (2013)","DOI":"10.1109\/BIBM.2013.6732603"},{"issue":"4","key":"12_CR38","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s10898-018-0714-2","volume":"74","author":"J Ma","year":"2019","unstructured":"Ma, J., Balasundaram, B.: On the chance-constrained minimum spanning k-core problem. J. Global Optim. 74(4), 783\u2013801 (2019)","journal-title":"J. Global Optim."},{"key":"12_CR39","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: Advances in Neural Information Processing Systems, pp. 41\u201350 (2006)"},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","volume-title":"Algorithms and Computation","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 403\u2013414. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17517-6_36"}],"container-title":["Lecture Notes in Computer Science","Complexity and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41672-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T02:06:14Z","timestamp":1582164374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41672-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030416713","9783030416720"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41672-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}