{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:12:48Z","timestamp":1779174768480,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP230101445"],"award-info":[{"award-number":["DP230101445"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE240100668"],"award-info":[{"award-number":["DE240100668"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT200100787"],"award-info":[{"award-number":["FT200100787"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP240101322"],"award-info":[{"award-number":["DP240101322"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP230101445"],"award-info":[{"award-number":["DP230101445"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT210100303"],"award-info":[{"award-number":["FT210100303"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U2241211"],"award-info":[{"award-number":["U2241211"]}],"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":["U20B2046"],"award-info":[{"award-number":["U20B2046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00778-025-00903-1","type":"journal-article","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T04:19:31Z","timestamp":1740370771000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Querying historical K-cores in large temporal graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Yuanhang","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,24]]},"reference":[{"key":"903_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: WWW, pp. 237\u2013248 (2014)","DOI":"10.1145\/2566486.2568007"},{"issue":"10","key":"903_CR2","first-page":"2439","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. TKDE 26(10), 2439\u20132452 (2014)","journal-title":"TKDE"},{"key":"903_CR3","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS, pp. 41\u201350 (2005)"},{"key":"903_CR4","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: K. Avrachenkov, D. Donato, N. Litvak (eds.) WAW, vol. 5427, pp. 25\u201337 (2009)","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"903_CR5","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049 (2003)"},{"key":"903_CR6","doi-asserted-by":"crossref","unstructured":"Chang, L.: Efficient maximum clique computation over large sparse graphs. In A. Teredesai, V. Kumar, Y. Li, R. Rosales, E. Terzi, G. Karypis (eds.) KDD, pp. 529\u2013538 (2019)","DOI":"10.1145\/3292500.3330986"},{"key":"903_CR7","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: K.A. Ross, D. Srivastava, D. Papadias (eds.) SIGMOD, pp. 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"issue":"5","key":"903_CR8","first-page":"1034","volume":"17","author":"K Chen","year":"2024","unstructured":"Chen, K., Wen, D., Zhang, W., Zhang, Y., Wang, X., Lin, X.: Querying structural diversity in streaming graphs. PVLDB 17(5), 1034\u20131046 (2024)","journal-title":"PVLDB"},{"key":"903_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., Tamer \u00d6zsu, M.: Efficient core decomposition in massive networks. In: S. Abiteboul, K. B\u00f6hm, C. Koch, K.-L. Tan (eds.) ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"903_CR10","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In C.E. Dyreson, F. Li, M.\u00a0Tamer \u00d6zsu (eds.) SIGMOD, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"903_CR11","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Blelloch, G.E., Shun, J.: Julienne: a framework for parallel graph algorithms using work-efficient bucketing. In: SPAA, pp. 293\u2013304 (2017)","DOI":"10.1145\/3087556.3087580"},{"issue":"12","key":"903_CR12","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Jiafeng, H.: Effective community search for large attributed graphs. PVLDB 9(12), 1233\u20131244 (2016)","journal-title":"PVLDB"},{"key":"903_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Xin Huang, L., Qin, Y.Z., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. VLDB J. 29, 353\u2013392 (2020)","journal-title":"VLDB J."},{"issue":"3\u20135","key":"903_CR14","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."},{"key":"903_CR15","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Barrat, A., Bonchi, F., Cattuto, C., Gullo, F.: Mining (maximal) span-cores from temporal networks. In: CIKM, pp. 107\u2013116 (2018)","DOI":"10.1145\/3269206.3271767"},{"key":"903_CR16","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Bonchi, F., Gullo, F.: Core decomposition and densest subgraph in multilayer networks. In: CIKM, pp. 1807\u20131816 (2017)","DOI":"10.1145\/3132847.3132993"},{"issue":"8","key":"903_CR17","doi-asserted-by":"publisher","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."},{"key":"903_CR18","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"},{"issue":"3","key":"903_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"903_CR20","doi-asserted-by":"crossref","unstructured":"Huo, W., Tsotras, V.J.: Efficient temporal shortest path queries on evolving social graphs. In: SSDBM, pp. 38:1\u201338:4. ACM (2014)","DOI":"10.1145\/2618243.2618282"},{"issue":"1\u20132","key":"903_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/rsa.20147","volume":"30","author":"S Janson","year":"2007","unstructured":"Janson, S., Luczak, M.J.: A simple solution to the k-core problem. Random Struct. Algorithms 30(1\u20132), 50\u201362 (2007)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"903_CR22","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Marina Barsky, S., Venkatesh, A.T.: K-core decomposition of large networks on a single PC. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"key":"903_CR23","doi-asserted-by":"crossref","unstructured":"Khurana, U., Deshpande, A.: Efficient snapshot retrieval over historical graph data. In: ICDE, pp. 997\u20131008 (2013)","DOI":"10.1109\/ICDE.2013.6544892"},{"issue":"6","key":"903_CR24","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos, V.: Temporal graphs. Physica A 388(6), 1007\u20131023 (2009)","journal-title":"Physica A"},{"key":"903_CR25","unstructured":"Labouseur, A.G., Olsen, P.W., Hwang, J.-H.: Scalable and robust management of dynamic graph data. In: BD3 VLDB 2013, 1018, pp. 43\u201348 (2013)"},{"key":"903_CR26","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"},{"key":"903_CR27","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":"903_CR28","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"},{"issue":"1","key":"903_CR29","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0012-365X(91)90162-U","volume":"91","author":"T Luczak","year":"1991","unstructured":"Luczak, T.: Size and connectivity of the k-core of a random graph. Discret. Math. 91(1), 61\u201368 (1991)","journal-title":"Discret. Math."},{"issue":"4","key":"903_CR30","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"issue":"2","key":"903_CR31","first-page":"288","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed k-core decomposition. TPDS 24(2), 288\u2013300 (2013)","journal-title":"TPDS"},{"key":"903_CR32","doi-asserted-by":"crossref","unstructured":"Nanavati, A.A., Gurumurthy, S., Das, G., Chakraborty, D., Dasgupta, K., Mukherjea, S., Joshi, A.: On the structural properties of massive telecom call graphs: findings and implications. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management, pp. 435\u2013444 (2006)","DOI":"10.1145\/1183614.1183678"},{"key":"903_CR33","doi-asserted-by":"crossref","unstructured":"Pechlivanidou, K., Katsaros, D., Tassiulas, L.: Mapreduce-based distributed k-shell decomposition for online social networks. In: SERVICES, pp. 30\u201337 (2014)","DOI":"10.1109\/SERVICES.2014.16"},{"issue":"11","key":"903_CR34","first-page":"726","volume":"4","author":"C Ren","year":"2011","unstructured":"Ren, C., Lo, E., Kao, B., Zhu, X., Cheng, R.: On querying historical evolving graph sequences. PVLDB 4(11), 726\u2013737 (2011)","journal-title":"PVLDB"},{"key":"903_CR35","unstructured":"Rost, C., Gomez, K., Christen, P., Rahm, E.: Evolution of degree metrics in large temporal graphs. In: Proceedings of BTW 2023, Datenbanksysteme f\u00fcr Business, Technologie und Web, Lecture Notes in Informatics (LNI), Bonn, Germany, 2023. Gesellschaft f\u00fcr Informatik"},{"issue":"6","key":"903_CR36","first-page":"433","volume":"6","author":"AE Sariy\u00fcce","year":"2013","unstructured":"Sariy\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Kun-Lung, W., \u00c7ataly\u00fcrek, V.\u00dc.: Streaming algorithms for k-core decomposition. PVLDB 6(6), 433\u2013444 (2013)","journal-title":"PVLDB"},{"issue":"3","key":"903_CR37","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":"903_CR38","doi-asserted-by":"crossref","unstructured":"Semertzidis, K., Pitoura, E.: Durable graph pattern queries on historical graphs. In: ICDE, pp. 541\u2013552 (2016)","DOI":"10.1109\/ICDE.2016.7498269"},{"key":"903_CR39","unstructured":"Semertzidis, K., Pitoura, E., Lillis, K.: Timereach: historical reachability queries on evolving graphs. In: EDBT, pp. 121\u2013132 (2015)"},{"issue":"3","key":"903_CR40","first-page":"157","volume":"2","author":"J Song","year":"2024","unstructured":"Song, J., Wen, D., Lantian, X., Qin, L., Zhang, W., Lin, X.: On querying historical connectivity in temporal graphs. SIGMOD 2(3), 157 (2024)","journal-title":"SIGMOD"},{"key":"903_CR41","doi-asserted-by":"crossref","unstructured":"Wen, D., Huang, Y., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Efficiently answering span-reachability queries in large temporal graphs. In: ICDE, pp. 1153\u20131164 (2020)","DOI":"10.1109\/ICDE48307.2020.00104"},{"key":"903_CR42","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Chang, L., Chen, L.: Enumerating k-vertex connected components in large graphs. In: ICDE, pp. 52\u201363 (2019)","DOI":"10.1109\/ICDE.2019.00014"},{"key":"903_CR43","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"},{"issue":"1","key":"903_CR44","first-page":"75","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. TKDE 31(1), 75\u201390 (2019)","journal-title":"TKDE"},{"key":"903_CR45","doi-asserted-by":"crossref","unstructured":"Wu, H., Cheng, J., Lu, Y., Ke, Y., Huang, Y., Yan, D., Wu, H.: Core decomposition in large temporal graphs. In: BigData, pp. 649\u2013658 (2015)","DOI":"10.1109\/BigData.2015.7363809"},{"key":"903_CR46","doi-asserted-by":"crossref","unstructured":"Yang, B., Wen, D., Qin, L., Zhang, Y., Chang, L., Li, R.-H.: Index-based optimal algorithm for computing k-cores in large uncertain graphs. In: ICDE, pp. 64\u201375 (2019)","DOI":"10.1109\/ICDE.2019.00015"},{"issue":"11","key":"903_CR47","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.14778\/3476249.3476260","volume":"14","author":"M Yu","year":"2021","unstructured":"Yu, M., Wen, D., Qin, L., Zhang, Y., Zhang, W., Lin, X.: On querying historical k-cores. Proc. VLDB Endow. 14(11), 2033\u20132045 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"903_CR48","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s11227-009-0299-0"},{"key":"903_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, W., Yang, Z., Wen, D., Wang, X.: Efficient distributed core graph decomposition. In: ICDM Workshop, pp. 1023\u20131031. IEEE (2023)","DOI":"10.1109\/ICDMW60847.2023.00135"},{"key":"903_CR50","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"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00903-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00903-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00903-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T07:32:46Z","timestamp":1744270366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00903-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,24]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["903"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00903-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,24]]},"assertion":[{"value":"16 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"26"}}