{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:13:33Z","timestamp":1770228813071,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819561957","type":"print"},{"value":"9789819561964","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-6196-4_2","type":"book-chapter","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:58:45Z","timestamp":1770184725000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Historical k-Core in\u00a0Parallel"],"prefix":"10.1007","author":[{"given":"Zhuo","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanchen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,5]]},"reference":[{"key":"2_CR1","unstructured":"The KONECT project. http:\/\/konect.cc\/"},{"key":"2_CR2","unstructured":"SNAP: stanford network analysis project. https:\/\/snap.stanford.edu\/"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/J.INS.2019.11.003","volume":"513","author":"W Bai","year":"2020","unstructured":"Bai, W., Chen, Y., Wu, D.: Efficient temporal core maintenance of massive graphs. Inf. Sci. 513, 324\u2013340 (2020). https:\/\/doi.org\/10.1016\/J.INS.2019.11.003","journal-title":"Inf. Sci."},{"key":"2_CR4","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks (2003). https:\/\/www.researchgate.net\/publication\/220489296_An_Om_Algorithm_for_Cores_Decomposition_of_Networks"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Cheng, J., Ke, Y., Chu, S., Ozsu, M.T.: Efficient core decomposition in massive networks. In: Proceedings - International Conference on Data Engineering, pp. 51\u201362 (2011). https:\/\/doi.org\/10.1109\/ICDE.2011.5767911","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Chu, L., Zhang, Y., Yang, Y., Wang, L., Pei, J.: Online density bursting subgraph detection from temporal graphs. Proc. VLDB Endowment 12, 2353\u20132365 (2019). https:\/\/doi.org\/10.14778\/3358701.3358704","DOI":"10.14778\/3358701.3358704"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 991\u20131002 (2014). https:\/\/doi.org\/10.1145\/2588555.2612179","DOI":"10.1145\/2588555.2612179"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Galimberti, E., Barrat, A., Bonchi, F., Cattuto, C., Gullo, F.: Mining (maximal) span-cores from temporal networks. In: International Conference on Information and Knowledge Management, Proceedings, pp. 107\u2013116 (2018). https:\/\/doi.org\/10.1145\/3269206.3271767","DOI":"10.1145\/3269206.3271767"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hao, K., Yuan, L., Yang, Z., Zhang, W., Lin, X.: Efficient and scalable distributed graph structural clustering at billion scale. In: International Conference on Database Systems for Advanced Applications, pp. 234\u2013251. Springer Nature Switzerland Cham (2023)","DOI":"10.1007\/978-3-031-30675-4_16"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single PC. Proc. VLDB Endowment 9, 13\u201323 (2015). https:\/\/doi.org\/10.14778\/2850469.2850471","DOI":"10.14778\/2850469.2850471"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Li, R.H., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018, pp. 797\u2013808 (2018). https:\/\/doi.org\/10.1109\/ICDE.2018.00077","DOI":"10.1109\/ICDE.2018.00077"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Li, Y., Liu, J., Zhao, H., Sun, J., Zhao, Y., Wang, G.: Efficient continual cohesive subgraph search in large temporal graphs. World Wide Web 24, 1483\u20131509 (2021). https:\/\/doi.org\/10.1007\/S11280-021-00917-Z\/METRICS, https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00917-z","DOI":"10.1007\/S11280-021-00917-Z\/METRICS"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Lin, L., et al.: QTCS: efficient query-centered temporal community search. Proc. VLDB Endowment 17, 1187\u20131199 (2024). https:\/\/doi.org\/10.14778\/3648160.3648163, https:\/\/www.researchgate.net\/publication\/380341564_QTCS_Efficient_Query-Centered_Temporal_Community_Search","DOI":"10.14778\/3648160.3648163"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Luo, Q., et al.: Hierarchical structure construction on hypergraphs. In: Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, pp. 1597\u20131606 (2024)","DOI":"10.1145\/3627673.3679765"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00778-025-00915-x","volume":"34","author":"Q Luo","year":"2025","unstructured":"Luo, Q., Zhang, W., Yang, Z., Yu, D., Lin, X., Wang, L.: Efficient indexing and searching of constrained core in hypergraphs. VLDB J. 34(3), 34 (2025)","journal-title":"VLDB J."},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Ma, S., Hu, R., Wang, L., Lin, X., Huai, J.: An efficient approach to finding dense temporal subgraphs. IEEE Trans. Knowl. Data Eng. 32, 645\u2013658 (2020). https:\/\/doi.org\/10.1109\/TKDE.2019.2891604","DOI":"10.1109\/TKDE.2019.2891604"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Montresor, A., Pellegrini, F.D., Miorandi, D.: Distributed K-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24, 288\u2013300 (2011). https:\/\/doi.org\/10.1109\/TPDS.2012.124, https:\/\/arxiv.org\/abs\/1103.5320v2","DOI":"10.1109\/TPDS.2012.124"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Qin, H., Li, R.H., Wang, G., Qin, L., Cheng, Y., Yuan, Y.: Mining periodic cliques in temporal networks. In: Proceedings - International Conference on Data Engineering 2019-April, pp. 1130\u20131141 (2019). https:\/\/doi.org\/10.1109\/ICDE.2019.00104","DOI":"10.1109\/ICDE.2019.00104"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Qin, H., Li, R.H., Yuan, Y., Wang, G., Yang, W., Qin, L.: Periodic communities mining in temporal networks: concepts and algorithms. IEEE Trans. Knowl. Data Eng. 34, 3927\u20133945 (2022). https:\/\/doi.org\/10.1109\/TKDE.2020.3028025","DOI":"10.1109\/TKDE.2020.3028025"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5, 269\u2013287 (1983). https:\/\/doi.org\/10.1016\/0378-8733(83)90028-X","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Starnini, M., et al.: Smurf-based anti-money laundering in time-evolving transaction networks. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12978 LNAI, pp. 171\u2013186 (2021). https:\/\/doi.org\/10.1007\/978-3-030-86514-6_11","DOI":"10.1007\/978-3-030-86514-6_11"},{"key":"2_CR22","doi-asserted-by":"publisher","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 2016 pp. 133\u2013144 (2015). https:\/\/doi.org\/10.1109\/ICDE.2016.7498235, https:\/\/arxiv.org\/abs\/1511.00367v1","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Wu, H., et al.: Core decomposition in large temporal graphs. In: 2015 IEEE International Conference on Big Data (Big Data), pp. 649\u2013658 (2015). https:\/\/doi.org\/10.1109\/BIGDATA.2015.7363809","DOI":"10.1109\/BIGDATA.2015.7363809"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Yang, J., et al.: Scalable time-range K-core query on temporal graphs. Proc. VLDB Endowment 16, 1168\u20131180 (2023). https:\/\/doi.org\/10.14778\/3579075.3579089","DOI":"10.14778\/3579075.3579089"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Yang, J., Zhong, M., Zhu, Y., Qian, T., Liu, M., Yu, J.X.: Evolution forest index: towards optimal temporal k-core component search via time-topology isomorphic computation. Proc. VLDB Endow. 17(11), 2840\u20132853 (2024). https:\/\/doi.org\/10.14778\/3681954.3681967","DOI":"10.14778\/3681954.3681967"},{"key":"2_CR26","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, 2033\u20132045 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR27","doi-asserted-by":"publisher","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, 352\u2013369 (2010). https:\/\/doi.org\/10.1007\/S11227-009-0299-0, https:\/\/www.researchgate.net\/publication\/220359026_Using_the_k-core_decomposition_to_analyze_the_static_structure_of_large-scale_software_systems","DOI":"10.1007\/S11227-009-0299-0"},{"issue":"1","key":"2_CR28","first-page":"1","volume":"3","author":"W Zhang","year":"2025","unstructured":"Zhang, W., Yang, Z., Wen, D., Li, W., Zhang, W., Lin, X.: Accelerating core decomposition in billion-scale hypergraphs. Proc. ACM Manag. Data 3(1), 1\u201327 (2025)","journal-title":"Proc. ACM Manag. Data"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, W., Yang, Z., Wen, D., Wang, X.: Efficient distributed core graph decomposition. In: 2023 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 1023\u20131031. IEEE (2023)","DOI":"10.1109\/ICDMW60847.2023.00135"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6196-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:58:47Z","timestamp":1770184727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6196-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819561957","9789819561964"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6196-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"5 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}