{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T10:34:36Z","timestamp":1762166076563,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819510207","type":"print"},{"value":"9789819510214","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"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-1021-4_20","type":"book-chapter","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T10:29:34Z","timestamp":1762165774000},"page":"269-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Achieving Efficient Temporal Graph Transformation on\u00a0the\u00a0GPU"],"prefix":"10.1007","author":[{"given":"Linchen","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4217-7886","authenticated-orcid":false,"given":"Jin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longlong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengshan","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,4]]},"reference":[{"key":"20_CR1","unstructured":"Berger, B., Singht, R., Xu, J.: Graph algorithms for biological systems analysis. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 142\u2013151 (2008)"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/3200691.3178506","volume":"53","author":"S Grossman","year":"2018","unstructured":"Grossman, S., Litz, H., Kozyrakis, C.: Making pull-based graph processing performant. ACM SIGPLAN Not. 53(1), 246\u2013260 (2018)","journal-title":"ACM SIGPLAN Not."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Roy, A., Bindschaedler, L., Malicevic, J., Zwaenepoel, W.: Chaos: scale-out graph processing from secondary storage. In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 410\u2013424 (2015)","DOI":"10.1145\/2815400.2815408"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Nguyen, G.H., Lee, J.B., Rossi, R.A., Ahmed, N.K., Koh, E., Kim, S.: Continuous-time dynamic network embeddings. In: Companion Proceedings of the Web Conference 2018, pp. 969\u2013976 (2018)","DOI":"10.1145\/3184558.3191526"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Mislove, A., Koppula, H.S., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Growth of the flickr social network. In: Proceedings of the First Workshop on Online Social Networks, pp. 25\u201330 (2008)","DOI":"10.1145\/1397735.1397742"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Serrat, O.: Social network analysis. In: Knowledge Solutions: Tools, Methods, and Approaches to Drive Organizational Performance, pp. 39\u201343 (2017)","DOI":"10.1007\/978-981-10-0983-9_9"},{"issue":"9","key":"20_CR7","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"W Huanhuan","year":"2014","unstructured":"Huanhuan, W., Cheng, J., Huang, S., Ke, Y., Yi, L., Yanyan, X.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Huan, C., et al.: Tegraph: a novel general-purpose temporal graph computing engine. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 578\u2013592. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00048"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"key":"20_CR10","unstructured":"Dekker, A.H.: Network centrality and super-spreaders in infectious disease epidemiology. In: 20th International Congress on Modelling and Simulation (MODSIM2013), pp. 331\u2013337. Citeseer (2013)"},{"issue":"19","key":"20_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.198701","volume":"110","author":"R Pfitzner","year":"2013","unstructured":"Pfitzner, R., Scholtes, I., Garas, A., Tessone, C.J., Schweitzer, F.: Betweenness preference: quantifying correlations in the topological dynamics $$<$$format$$>$$ of temporal networks. Phys. Rev. Lett. 110(19), 198701 (2013)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14(3), 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Gandhi, S., Simmhan, Y.: An interval-centric model for distributed computing over temporal graphs. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1129\u20131140. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00102"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Han, W., et al. Chronos: a graph engine for temporal graph analysis. In: Proceedings of the Ninth European Conference on Computer Systems, pp. 1\u201314 (2014)","DOI":"10.1145\/2592798.2592799"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kankanamge, C., Sahu, S., Mhedbhi, A., Chen, J., Salihoglu, S.: Graphflow: an active graph database. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 1695\u20131698 (2017)","DOI":"10.1145\/3035918.3056445"},{"issue":"11","key":"20_CR16","doi-asserted-by":"publisher","first-page":"2927","DOI":"10.1109\/TKDE.2016.2594065","volume":"28","author":"W Huanhuan","year":"2016","unstructured":"Huanhuan, W., Cheng, J., Ke, Y., Huang, S., Huang, Y., Hejun, W.: Efficient algorithms for temporal path computation. IEEE Trans. Knowl. Data Eng. 28(11), 2927\u20132942 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 145\u2013156. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498236"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, T., et al.: Efficient exact and approximate betweenness centrality computation for temporal graphs. In: Proceedings of the ACM on Web Conference 2024, pp. 2395\u20132406 (2024)","DOI":"10.1145\/3589334.3645438"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1109\/TPDS.2024.3393914","volume":"35","author":"C Huan","year":"2024","unstructured":"Huan, C., et al.: Tegraph+: scalable temporal graph processing enabling flexible edge modifications. IEEE Trans. Parallel Distrib. Syst. 35, 1469\u20131487 (2024)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Hessel, J., Tan, C., Lee, L.: Science, askscience, and badscience: on the coexistence of highly related communities. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 10, pp. 171\u2013180 (2016)","DOI":"10.1609\/icwsm.v10i1.14739"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Sinha, A., et al.: An overview of microsoft academic service (mas) and applications. In: Proceedings of the 24th International Conference on World Wide Web, pp. 243\u2013246 (2015)","DOI":"10.1145\/2740908.2742839"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Boldi, P., Santini, M., Vigna, S.: A large time-aware web graph. In: ACM SIGIR Forum, vol. 42, pp. 33\u201338. ACM, New York (2008)","DOI":"10.1145\/1480506.1480511"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Cha, M., Haddadi, H., Benevenuto, F., Gummadi, K.: Measuring user influence in twitter: the million follower fallacy. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 4, pp. 10\u201317 (2010)","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"20_CR24","unstructured":"Iosup, A., et\u00a0al.: The LDBC graphalytics benchmark. arXiv preprint arXiv:2011.15028 (2020)"}],"container-title":["Lecture Notes in Computer Science","Advanced Parallel Processing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-1021-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T10:29:43Z","timestamp":1762165783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-1021-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,4]]},"ISBN":["9789819510207","9789819510214"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-1021-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,4]]},"assertion":[{"value":"4 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Advanced Parallel Processing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"13 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"appt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.appt-conference.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}