{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:05:51Z","timestamp":1755839151586,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002073"],"award-info":[{"award-number":["62002073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Basic and Applied Basic Research Foundation","award":["202102020675"],"award-info":[{"award-number":["202102020675"]}]}],"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-00907-1","type":"journal-article","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T18:02:51Z","timestamp":1623952971000},"page":"723-740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["VEK: a vertex-oriented approach for edge k-core problem"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4429-7048","authenticated-orcid":false,"given":"Zhongxin","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenchao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deming","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binghao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"907_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.V.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinforma. 4, 2 (2003)","journal-title":"BMC Bioinforma."},{"key":"907_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"issue":"3","key":"907_CR3","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar, K., Kleinberg, J.M., Lewi, K., Roughgarden, T., Sharma, A.: Preventing unraveling in social networks: The anchored k-core problem. SIAM J. Discrete Math. 29(3), 1452\u20131475 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"9","key":"907_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"key":"907_CR5","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":"907_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Fu, A.W., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks by h*-graph. In: SIGMOD, pp. 447\u2013458 (2010)","DOI":"10.1145\/1807167.1807217"},{"key":"907_CR7","doi-asserted-by":"crossref","unstructured":"Chitnis, R., Talmon, N.: Can we create large k-cores by adding few edges?. In: CSR, pp. 78\u201389 (2018)","DOI":"10.1007\/978-3-319-90530-3_8"},{"key":"907_CR8","doi-asserted-by":"crossref","unstructured":"Chu, D., Zhang, F., Lin, X., Zhang, W., Zhang, Y., Xia, Y., Zhang, C.: Finding the best k in core decomposition: A time and space optimal solution. In: ICDE, pp. 685\u2013696 (2020)","DOI":"10.1109\/ICDE48307.2020.00065"},{"issue":"1","key":"907_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/1467-937X.00118","volume":"67","author":"MSY Chwe","year":"2000","unstructured":"Chwe, M.S.Y.: Communication and coordination in social networks. Rev. Econ. Stud. 67(1), 1\u201316 (2000)","journal-title":"Rev. Econ. Stud."},{"key":"907_CR10","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":"907_CR11","doi-asserted-by":"crossref","unstructured":"Dasari, NS., Ranjan, D., Zubair, M.: Park: An efficient algorithm for k-core decomposition on multicore processors. In: 2014 IEEE International Conference on Big Data, pp 9\u201316. IEEE Computer Society (2014)","DOI":"10.1109\/BigData.2014.7004366"},{"key":"907_CR12","unstructured":"Elsharkawy, S., Hassan, G., Nabhan, T., Roushdy, M.: Effectiveness of the k-core nodes as seeds for influence maximisation in dynamic cascades. Int. J. Comput., 2 (2017)"},{"issue":"6","key":"907_CR13","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"},{"key":"907_CR14","doi-asserted-by":"crossref","unstructured":"Kabir, H., Madduri, K.: Parallel k-core decomposition on multicore platforms. In: IPDPS Workshops, pp 1482\u20131491. IEEE Computer Society (2017)","DOI":"10.1109\/IPDPSW.2017.151"},{"key":"907_CR15","doi-asserted-by":"crossref","unstructured":"Kapron, B.M., Srivastava, G., Venkatesh, S.: Social network anonymization via edge addition. In: ASONAM, pp 155\u2013162. IEEE Computer Society (2011)","DOI":"10.1109\/ASONAM.2011.108"},{"issue":"1","key":"907_CR16","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Venkatesh, S., Thomo, A.: K-core decomposition of large networks on a single PC. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"issue":"11","key":"907_CR17","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 (2010)","journal-title":"Nat. Phys."},{"key":"907_CR18","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.endm.2005.06.062","volume":"22","author":"Y Lai","year":"2005","unstructured":"Lai, Y., Tian, C., Ko, T.: Edge addition number of cartesian product of paths and cycles. Electron. Notes Discret. Math. 22, 439\u2013444 (2005)","journal-title":"Electron. Notes Discret. Math."},{"key":"907_CR19","doi-asserted-by":"crossref","unstructured":"Li, R., 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":"907_CR20","first-page":"509","volume":"8","author":"R Li","year":"2015","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"key":"907_CR21","doi-asserted-by":"crossref","unstructured":"Lin, Z., Zhang, F., Lin, X., Zhang, W., Tian, Z.: Hierarchical core maintenance on large dynamic graphs. In: VLDB, vol. 14, pp 757\u2013770 (2021)","DOI":"10.14778\/3446095.3446099"},{"key":"907_CR22","doi-asserted-by":"crossref","unstructured":"Linghu, Q., Zhang, F., Lin, X., Zhang, W., Zhang, Y.: Global reinforcement of social networks: The anchored coreness problem. In: SIGMOD, pp 2211\u20132226 (2020)","DOI":"10.1145\/3318464.3389744"},{"key":"907_CR23","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, F., Zhang, C., Zhang, W., Lin, X.: Corecube: Core decomposition in multilayer graphs. In: WISE 2019, pp 694\u2013710 (2019)","DOI":"10.1007\/978-3-030-34223-4_44"},{"key":"907_CR24","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, F., Zhang, W., Lin, X., Zhang, Y.: Efficient community search with size constraint. In: ICDE (2021)","DOI":"10.1109\/ICDE51399.2021.00016"},{"issue":"1","key":"907_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","volume":"29","author":"FD Malliaros","year":"2020","unstructured":"Malliaros, F.D., Giatsidis, C., Papadopoulos, A.N., Vazirgiannis, M.: The core decomposition of networks: theory, algorithms and applications. VLDB J. 29(1), 61\u201392 (2020)","journal-title":"VLDB J."},{"key":"907_CR26","doi-asserted-by":"publisher","first-page":"19307","DOI":"10.1038\/srep19307","volume":"6","author":"FD Malliaros","year":"2016","unstructured":"Malliaros, F.D., Rossi, M.E.G., Vazirgiannis, M.: Locating influential nodes in complex networks. Scientific Reports 6, 19307 (2016)","journal-title":"Scientific Reports"},{"key":"907_CR27","doi-asserted-by":"crossref","unstructured":"Malliaros, F.D., Vazirgiannis, M.: To stay or not to stay: modeling engagement dynamics in social graphs. In: CIKM, pp. 469\u2013478 (2013)","DOI":"10.1145\/2505515.2505561"},{"issue":"3","key":"907_CR28","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"issue":"2","key":"907_CR29","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., Pellegrini, F.D., Miorandi, D.: Distributed k-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"907_CR30","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: SIGKDD, pp. 228\u2013238 (2005)","DOI":"10.1145\/1081870.1081898"},{"issue":"3","key":"907_CR31","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. Social Networks 5(3), 269\u2013287 (1983)","journal-title":"Social Networks"},{"key":"907_CR32","doi-asserted-by":"crossref","unstructured":"Shin, K., Eliassi-Rad, T., Faloutsos, C.: Corescope: Graph mining using k-core analysis - patterns, anomalies and algorithms. In: ICDM, pp. 469\u2013478 (2016)","DOI":"10.1109\/ICDM.2016.0058"},{"issue":"1","key":"907_CR33","first-page":"26","volume":"4","author":"SA Suady","year":"2014","unstructured":"Suady, S.A., Najim, A.A.: On edge-addition problem. Journal of Education for Pure Science 4(1), 26\u201336 (2014)","journal-title":"Journal of Education for Pure Science"},{"issue":"16","key":"907_CR34","doi-asserted-by":"publisher","first-page":"5962","DOI":"10.1073\/pnas.1116502109","volume":"109","author":"J Ugander","year":"2012","unstructured":"Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.M.: Structural diversity in social contagion. Proc. Natl. Acad. Sci. U.S.A. 109(16), 5962\u20135966 (2012)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"9","key":"907_CR35","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":"907_CR36","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16-19, 2018, pp. 233\u2013244 (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"key":"907_CR37","doi-asserted-by":"crossref","unstructured":"Wang, K., Wang, S., Cao, X., Qin, L.: Efficient radius-bounded community search in geo-social networks. IEEE Transactions on Knowledge and Data Engineering (2020)","DOI":"10.1109\/TKDE.2020.3040172"},{"key":"907_CR38","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/O efficient core graph decomposition at web scale. In: ICDE, pp. 133\u2013144 (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"907_CR39","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Fast incremental simrank on link-evolving graphs. In: IEEE 30th International Conference on Data Engineering, Chicago, pp. 304\u2013315 (2014)","DOI":"10.1109\/ICDE.2014.6816660"},{"issue":"5","key":"907_CR40","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","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. IEEE Trans. Knowl. Data Eng. 30(5), 922\u2013935 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"907_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, C., Zhang, F., Zhang, W., Liu, B., Zhang, Y., Qin, L., Lin, X.: Exploring finer granularity within the cores: Efficient (k, p)-core computation. In: ICDE, pp. 181\u2013192 (2020)","DOI":"10.1109\/ICDE48307.2020.00023"},{"issue":"6","key":"907_CR42","first-page":"649","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, W., Zhang, Y., Qin, L., Lin, X.: OLAK: an efficient algorithm to prevent unraveling in social networks. PVLDB 10 (6), 649\u2013660 (2017)","journal-title":"PVLDB"},{"key":"907_CR43","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Finding critical users for social network engagement: The collapsed k-core problem. In: AAAI, pp. 245\u2013251 (2017)","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"907_CR44","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Efficiently reinforcing social networks over user engagement and tie strength. In: ICDE, pp. 557\u2013568 (2018)","DOI":"10.1109\/ICDE.2018.00057"},{"issue":"2","key":"907_CR45","doi-asserted-by":"crossref","first-page":"217","DOI":"10.23919\/JCIN.2020.9130437","volume":"5","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Wang, X., Fan, H., Cai, T., Li, J., Li, X., Leung, V.C.M.: Anchor vertex selection for enhanced reliability of traffic offloading service in edge-enabled mobile P2P social networks. J. Commun. Inf. Networks 5(2), 217\u2013224 (2020)","journal-title":"J. Commun. Inf. Networks"},{"key":"907_CR46","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Zhang, F., Lin, X., Zhang, W., Chen, C.: K-core maximization: An edge addition approach. In: IJCAI, pp. 4867\u20134873 (2019)","DOI":"10.24963\/ijcai.2019\/676"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00907-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00907-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00907-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T14:40:29Z","timestamp":1672497629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00907-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,17]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["907"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00907-1","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2021,6,17]]},"assertion":[{"value":"1 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 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":"17 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}