{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T18:02:41Z","timestamp":1750356161346,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819612413"},{"type":"electronic","value":"9789819612420"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1242-0_17","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T08:06:21Z","timestamp":1733990781000},"page":"224-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Answering of\u00a0k-Reachability on\u00a0Temporal Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Zhuoqing","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoshuang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huangleshuai","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.F.: Hierarchical hub labelings for shortest paths. In: European Symposium on Algorithms, pp. 24\u201335 (2012)","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Kawarabayashi, K.I., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 147\u2013154. SIAM (2014)","DOI":"10.1137\/1.9781611973198.14"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 349\u2013360. ACM (2013)","DOI":"10.1145\/2463676.2465315"},{"issue":"7039","key":"17_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"AL Barabasi","year":"2005","unstructured":"Barabasi, A.L.: The origin of bursts and heavy tails in human dynamics. Nature 435(7039), 207\u2013211 (2005)","journal-title":"Nature"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovic, K., Patterson, D.: Direction-optimizing breadth-first search. In: SC 2012: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, pp. 1\u201310. IEEE (2012)","DOI":"10.1109\/SC.2012.50"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Carrasco, B., Lu, Y., Da\u00a0Trindade, J.M.F.: Partitioning social networks for time-dependent queries. In: Proceedings of the 4th Workshop on Social Network Systems (SNS 2011) (2011). https:\/\/doi.org\/10.1145\/1989656.1989658","DOI":"10.1145\/1989656.1989658"},{"key":"17_CR7","unstructured":"Casteigts, A., Himmel, A.S., Molter, H., Zschoche, P.: The computational complexity of finding temporal paths under waiting time constraints. arXiv preprint arXiv:1909.06437 (2019)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.14778\/3467861.3467873","volume":"14","author":"X Chen","year":"2021","unstructured":"Chen, X., Wang, K., Lin, X., Zhang, W., Qin, L., Zhang, Y.: Efficiently answering reachability and path queries on temporal bipartite graphs. Proc. VLDB Endow. 14, 1845\u20131858 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.14778\/2350229.2350247","volume":"5","author":"J Cheng","year":"2012","unstructured":"Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: K-reach: who is in your small world? Proc. VLDB Endow. 5(11), 1292\u20131303 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32, 1338\u20131355 (2003). https:\/\/doi.org\/10.1137\/S0097539702403098","journal-title":"SIAM J. Comput."},{"key":"17_CR11","unstructured":"Cohen, E., et\u00a0al.: Reachability and distance queries via 2-hop labels. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937\u2013946 (2002)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-dependent route planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207\u2013230. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05465-5_8"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inf. Sci. (2021). https:\/\/doi.org\/10.1016\/j.ins.2021.04.027","DOI":"10.1016\/j.ins.2021.04.027"},{"key":"17_CR14","unstructured":"Kemper, A.H., Library, A.D.: Advances in database technology: EDBT 2008: 11th international conference on extending database technology. In: Proceedings of the 11th International Conference on Extending Database Technology, Nantes, France, p.\u00a0748 (2008)"},{"key":"17_CR15","unstructured":"Konect. http:\/\/konect.cc\/. Accessed 25 Aug 2024"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1111\/jebm.12508","volume":"15","author":"Y Li","year":"2022","unstructured":"Li, Y., Tan, J., Tan, S., et al.: Infection rate and factors affecting close contacts of COVID-19 cases: a systematic review. J. Evid. Based Med. 15, 385\u2013397 (2022). https:\/\/doi.org\/10.1111\/jebm.12508","journal-title":"J. Evid. Based Med."},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Liu, Z., Li, L., Zhang, M., Hua, W., Chao, P., Zhou, X.: Efficient constrained shortest path query answering with forest hop labeling. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1763\u20131774 (2021). https:\/\/doi.org\/10.1109\/ICDE51399.2021.00155","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"L\u00e8bre, S., et\u00a0al.: Statistical inference of the time-varying structure of gene-regulation networks. BMC Syst. Biol. 4 (2010). https:\/\/doi.org\/10.1186\/1752-0509-4-130","DOI":"10.1186\/1752-0509-4-130"},{"issue":"10","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevLett.114.108701","volume":"114","author":"A Moinet","year":"2015","unstructured":"Moinet, A., Starnini, M., Pastor-Satorras, R.: Burstiness and aging in social temporal networks. Phys. Rev. Lett. 114(10), 1\u20135 (2015). https:\/\/doi.org\/10.1103\/PhysRevLett.114.108701","journal-title":"Phys. Rev. Lett."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Peng, Y., Lin, X., Zhang, Y., Zhang, W., Qin, L.: Answering reachability and k-reach queries on large graphs with label constraints. VLDB J. 1\u201327 (2022)","DOI":"10.1007\/s00778-021-00695-0"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/bib\/bbp057","volume":"11","author":"TM Przytycka","year":"2010","unstructured":"Przytycka, T.M., Singh, M., Slonim, D.K.: Toward the dynamic interactome: it\u2019s about time. Brief. Bioinform. 11(1), 15\u201329 (2010). https:\/\/doi.org\/10.1093\/bib\/bbp057","journal-title":"Brief. Bioinform."},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Semertzidis, K., Lillis, K., Pitoura, E.: TimeReach: historical reachability queries on evolving graphs. In: EDBT 2015 - Proceedings of the 18th International Conference on Extending Database Technology (2015). https:\/\/doi.org\/10.5441\/002\/edbt.2015.12","DOI":"10.5441\/002\/edbt.2015.12"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Veloso, R.R., et\u00a0al.: Reachability queries in very large graphs: a fast refined online search approach. In: Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, pp. 511\u2013522 (2014). https:\/\/doi.org\/10.5441\/002\/edbt.2014.46","DOI":"10.5441\/002\/edbt.2014.46"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Wang, C., et\u00a0al.: Dynamic social influence analysis through time-dependent factor graphs. In: Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2011), pp. 239\u2013246 (2011). https:\/\/doi.org\/10.1109\/ASONAM.2011.116","DOI":"10.1109\/ASONAM.2011.116"},{"issue":"10","key":"17_CR25","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.14778\/3339490.3339497","volume":"12","author":"K Wang","year":"2019","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. Proc. VLDB Endow. 12(10), 1139\u20131152 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 661\u2013672. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDB J. 1\u201324 (2021)","DOI":"10.1007\/s00778-021-00658-5"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 967\u2013982 (2015)","DOI":"10.1145\/2723372.2749456"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Wen, D., et\u00a0al.: Efficiently answering span-reachability queries in large temporal graphs. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 1153\u20131164 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00104","DOI":"10.1109\/ICDE48307.2020.00104"},{"key":"17_CR30","unstructured":"Wolframmathworld homepage. https:\/\/mathworld.wolfram.com\/RandomNumber.html. Accessed 25 Aug 2024"},{"issue":"02","key":"17_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BB Xuan","year":"2003","unstructured":"Xuan, B.B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(02), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Yuan, W., Yang, C., Qu, L., Nguyen, Q.V.H., Ye, G., Yin, H.: PTF-FSR: a parameter transmission-free federated sequential recommender system (2024). https:\/\/arxiv.org\/abs\/2406.05387","DOI":"10.1145\/3708344"},{"issue":"6","key":"17_CR33","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s00778-019-00572-x","volume":"28","author":"T Zhang","year":"2019","unstructured":"Zhang, T., et al.: Efficient distributed reachability querying of massive temporal graphs. VLDB J. 28(6), 871\u2013896 (2019)","journal-title":"VLDB J."},{"issue":"2","key":"17_CR34","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00778-018-0495-8","volume":"27","author":"J Zhou","year":"2018","unstructured":"Zhou, J., et al.: Accelerating reachability query processing based on DAG reduction. VLDB J. 27(2), 271\u2013296 (2018). https:\/\/doi.org\/10.1007\/s00778-018-0495-8","journal-title":"VLDB J."},{"key":"17_CR35","doi-asserted-by":"publisher","unstructured":"Zignani, M.: Human mobility model based on time-varying bipartite graph. In: 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM 2011), pp.\u00a02\u20135 (2011). https:\/\/doi.org\/10.1109\/WoWMoM.2011.5986376","DOI":"10.1109\/WoWMoM.2011.5986376"}],"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-96-1242-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T20:04:55Z","timestamp":1736193895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1242-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819612413","9789819612420"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1242-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","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":"Gold Coast, QLD","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}