{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:50:14Z","timestamp":1768679414804,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802140"],"award-info":[{"award-number":["61802140"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972447"],"award-info":[{"award-number":["61972447"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11280-020-00857-0","type":"journal-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T06:08:41Z","timestamp":1609826921000},"page":"541-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Core decomposition and maintenance in weighted graph"],"prefix":"10.1007","volume":"24","author":[{"given":"Wei","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang-Sheng","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"857_CR1","doi-asserted-by":"crossref","unstructured":"Al-Garadi, M.A., Varathan, K.D., Ravana, S.D.: Identification of influential spreaders in online social networks using interaction weighted k-core decomposition method. Physica A Statistical Mechanics and Its Applications, S0378437116308068 (2016)","DOI":"10.1016\/j.physa.2016.11.002"},{"key":"857_CR2","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":"857_CR3","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 (2016)","DOI":"10.1145\/2933267.2933299"},{"key":"857_CR4","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Mrvar, A., Zaver\u0161nik, M.: Partitioning approach to visualization of large graphs. In: International Symposium on Graph Drawing, pp. 90\u201397. Springer (1999)","DOI":"10.1007\/3-540-46648-7_9"},{"key":"857_CR5","unstructured":"Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks. arXiv:cs\/0310049 (2003)"},{"key":"857_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M. T.: Efficient core decomposition in massive networks. In: Abiteboul, S., B\u00f6hm, K., Koch, C., Tan, K. (eds.) Proceedings of the 27th International Conference on Data Engineering, ICDE, pp. 51\u201362. IEEE Computer Society (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"857_CR7","first-page":"3","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National Security Agency Technical Report 16, 3\u20131 (2008)","journal-title":"National Security Agency Technical Report"},{"key":"857_CR8","doi-asserted-by":"crossref","unstructured":"Dasari, N.S., Desh, R., Zubair, M.: Park: An efficient algorithm for k-core decomposition on multicore processors. In: 2014 IEEE International Conference on Big Data (Big Data), pp. 9\u201316. IEEE (2014)","DOI":"10.1109\/BigData.2014.7004366"},{"issue":"6","key":"857_CR9","doi-asserted-by":"publisher","first-page":"062,819","DOI":"10.1103\/PhysRevE.88.062819","volume":"88","author":"M Eidsaa","year":"2013","unstructured":"Eidsaa, M., Almaas, E.: S-core network decomposition: A generalization of k-core analysis to weighted networks. Phys. Rev. E 88(6), 062,819 (2013)","journal-title":"Phys. Rev. E"},{"issue":"3\u20135","key":"857_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486 (3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"8","key":"857_CR11","first-page":"083,030","volume":"14","author":"A Garas","year":"2012","unstructured":"Garas, A., Schweitzer, F., Havlin, S.: A k-shell decomposition method for weighted networks. J. Phys. 14(8), 083,030 (2012)","journal-title":"J. Phys."},{"issue":"6","key":"857_CR12","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1109\/TPDS.2019.2960226","volume":"31","author":"Q Hua","year":"2020","unstructured":"Hua, Q., Shi, Y., Yu, D., Jin, H., Yu, J., Cai, Z., Cheng, X., Chen, H.: Faster parallel core maintenance algorithms in dynamic graphs. IEEE Trans. Parallel Distrib. Syst. 31(6), 1287\u20131300 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"857_CR13","doi-asserted-by":"crossref","unstructured":"Huang, C., Fu, Y., Sun, C.: Identify influential social network spreaders. In: 2014 IEEE International Conference on Data Mining Workshops, ICDM workshop, pp. 562\u2013568. IEEE Computer Society (2014)","DOI":"10.1109\/ICDMW.2014.31"},{"issue":"11","key":"857_CR14","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."},{"issue":"1","key":"857_CR15","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. Proceed. Vldb Endow. 9(1), 13\u201323 (2015)","journal-title":"Proceed. Vldb Endow."},{"issue":"11","key":"857_CR16","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"key":"857_CR17","unstructured":"Leskovec, J., Krevl, A.: Snap datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data, p. 49 (2016) (2014)"},{"issue":"5","key":"857_CR18","doi-asserted-by":"publisher","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"R Li","year":"2015","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. Proc. VLDB Endow. 8(5), 509\u2013520 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"857_CR19","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."},{"key":"857_CR20","doi-asserted-by":"publisher","first-page":"63,872","DOI":"10.1109\/ACCESS.2020.2985327","volume":"8","author":"B Liu","year":"2020","unstructured":"Liu, B., Zhang, F.: Incremental algorithms of the core maintenance problem on edge-weighted graphs. IEEE Access 8, 63,872\u201363,884 (2020)","journal-title":"IEEE Access"},{"issue":"2","key":"857_CR21","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. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"857_CR22","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jmbi.1998.1689","volume":"279","author":"R Samudrala","year":"1998","unstructured":"Samudrala, R., Moult, J.: A graph-theoretic algorithm for comparative modeling of protein structure. J. Molec. Biol. 279(1), 287\u2013302 (1998)","journal-title":"J. Molec. Biol."},{"issue":"3","key":"857_CR23","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.\u2014Int. J. Very Large Data Bases 25(3), 425\u2013447 (2016)","journal-title":"VLDB J.\u2014Int. J. Very Large Data Bases"},{"key":"857_CR24","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 (2017)","DOI":"10.1109\/ICDCS.2017.288"},{"key":"857_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.physa.2014.11.012","volume":"420","author":"B Wei","year":"2015","unstructured":"Wei, B., Liu, J., Wei, D., Gao, C., Deng, Y.: Weighted k-shell decomposition for complex networks based on potential edge weights. Physica A: Statist. Mech. Appl. 420, 277\u2013283 (2015)","journal-title":"Physica A: Statist. Mech. Appl."},{"key":"857_CR26","doi-asserted-by":"crossref","unstructured":"Wu, X., Wei, W., Tang, L., Lu, J., L\u00fc, J.: Coreness and h-index for weighted networks. IEEE Transactions on Circuits and Systems I: Regular Papers (2019)","DOI":"10.1109\/TCSI.2019.2907751"},{"issue":"2","key":"857_CR27","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s11227-009-0299-0","volume":"53","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Zhao, H., Cai, W., Liu, J., Zhou, W.: Using the k-core decomposition to analyze the static structure of large-scale software systems. J. Supercomput. 53(2), 352\u2013369 (2010)","journal-title":"J. Supercomput."},{"key":"857_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: 33rd IEEE International Conference on Data Engineering, pp. 337\u2013348. IEEE Computer Society (2017)","DOI":"10.1109\/ICDE.2017.93"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00857-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-020-00857-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00857-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T16:40:26Z","timestamp":1616258426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-020-00857-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["857"],"URL":"https:\/\/doi.org\/10.1007\/s11280-020-00857-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"20 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}