{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:03:48Z","timestamp":1764997428167,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T00:00:00Z","timestamp":1640217600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T00:00:00Z","timestamp":1640217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00c3\u00af\u00c2\u00bf\u00c2\u00bd Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00c3\u00af\u00c2\u00bf\u00c2\u00bdoamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s13278-021-00851-y","type":"journal-article","created":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T05:02:18Z","timestamp":1640235738000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A dynamic data structure for temporal reachability with unsorted contact insertions"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1281-244X","authenticated-orcid":false,"given":"Luiz F. A.","family":"Brito","sequence":"first","affiliation":[]},{"given":"Marcelo K.","family":"Albertini","sequence":"additional","affiliation":[]},{"given":"Arnaud","family":"Casteigts","sequence":"additional","affiliation":[]},{"given":"Bruno A. N.","family":"Traven\u00e7olo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"851_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Borgida A, Jagadish HV (1989). Efficient management of transitive relationships in large data and knowledge bases, vol \u201989. Association for Computing Machinery, New York, NY, USA, pp 253\u2013262","DOI":"10.1145\/66926.66950"},{"key":"851_CR1","unstructured":"Birthday problem \u2014 Wikipedia, the free encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Birthday_problem&oldid=1027170129#Average_number_of_people_to_get_at_least_one_shared_birthday (2021). [Online; accessed 30-June-2021]"},{"key":"851_CR3","unstructured":"Barjon M, Casteigts A, Chaumette S, Johnen C, Neggaz YM (arxiv:1404.7634 (2014).) Testing temporal connectivity in sparse dynamic graphs. CoRR"},{"key":"851_CR4","doi-asserted-by":"crossref","unstructured":"Bedogni L, Fiore M, Glacet C (2018) Temporal reachability in vehicular networks. pp 81\u201389","DOI":"10.1109\/INFOCOM.2018.8486393"},{"key":"851_CR5","doi-asserted-by":"crossref","unstructured":"Blelloch GE, Ferizovic D, Sun Y (2016). Just join for parallel ordered sets, vol \u201916. Association for Computing Machinery, New York, NY, USA, pp 253\u2013264","DOI":"10.1145\/2935764.2935768"},{"issue":"1","key":"851_CR6","first-page":"47","volume":"28","author":"D Bryce","year":"2007","unstructured":"Bryce D, Kambhampati S (2007) A tutorial on planning graph based reachability heuristics. AI Magaz 28(1):47","journal-title":"AI Magaz"},{"key":"851_CR7","doi-asserted-by":"crossref","unstructured":"Cacciari, L., Rafiq, O.: A temporal reachability analysis. In: P.\u00a0Dembi\u0144ski, M.\u00a0\u015aredniawa (eds.) Protocol Specification, Testing and Verification XV: Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, Warsaw, Poland, June 1995, pp. 35\u201349. Springer US, Boston, MA (1996)","DOI":"10.1007\/978-0-387-34892-6_3"},{"issue":"5","key":"851_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2012) Time-varying graphs and dynamic networks. Int J Parallel, Emergent Distrib Syst 27(5):387\u2013408","journal-title":"Int J Parallel, Emergent Distrib Syst"},{"issue":"5","key":"851_CR9","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 (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32(5):1338\u20131355. https:\/\/doi.org\/10.1137\/S0097539702403098","journal-title":"SIAM J Comput"},{"key":"851_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcss.2021.01.007","volume":"119","author":"J Enright","year":"2021","unstructured":"Enright J, Meeks K, Mertzios GB, Zamaraev V (2021) Deleting edges to restrict the size of an epidemic in temporal networks. J Computer Syst Sci 119:60\u201377","journal-title":"J Computer Syst Sci"},{"key":"851_CR11","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-540-73540-3_26","volume-title":"Advances in Spatial and Temporal Databases","author":"B George","year":"2007","unstructured":"George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Papadias D, Zhang D, Kollios G (eds) Advances in Spatial and Temporal Databases. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 460\u2013477"},{"key":"851_CR12","doi-asserted-by":"crossref","unstructured":"Haixun Wang, Hao He, Jun Yang, Yu, P.S., Yu, J.X.: Dual labeling: answering graph reachability queries in constant time. In: 22nd International Conference on Data Engineering (ICDE\u201906), pp. 75\u201375 (2006)","DOI":"10.1109\/ICDE.2006.53"},{"key":"851_CR13","unstructured":"Hasan, K.T., Noori, S.R.H., Salam, A., Kabir, M.A.: Making sense of time: timeline visualization for public transport schedule. In: Symposium on Human-Computer Interaction and Information Retrieval (HCIR 2011), Washington (2011)"},{"issue":"8","key":"851_CR14","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1109\/TVCG.2013.246","volume":"20","author":"C Hurter","year":"2014","unstructured":"Hurter C, Ersoy O, Fabrikant SI, Klein TR, Telea AC (2014) Bundled visualization of dynamicgraph and trail data. IEEE Trans Visual Computer Gr 20(8):1141\u20131157","journal-title":"IEEE Trans Visual Computer Gr"},{"issue":"1","key":"851_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-017-0479-5","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy M, Viard T, Magnien C (2018) Stream graphs and link streams for the modeling of interactions over time. Soc Netw Anal Mining 8(1):1\u201329","journal-title":"Soc Netw Anal Mining"},{"issue":"10","key":"851_CR16","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1111\/2041-210X.12799","volume":"8","author":"AC Martensen","year":"2017","unstructured":"Martensen AC, Saura S, Fortin MJ (2017) Spatio-temporal connectivity: assessing the amount of reachable habitat in dynamic landscapes. Methods Ecol Evol 8(10):1253\u20131264","journal-title":"Methods Ecol Evol"},{"key":"851_CR17","unstructured":"Moffitt VZ, Stoyanovich J ((2016). arxiv:1602.00773.) Portal: A Query Language for Evolving Graphs. CoRR"},{"key":"851_CR18","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Gionis A, Prakash BA, Vreeken J (2016). Reconstructing an epidemic over time, vol KDD \u201916. Association for Computing Machinery, New York, NY, USA, pp 1835\u20131844","DOI":"10.1145\/2939672.2939865"},{"key":"851_CR19","doi-asserted-by":"crossref","unstructured":"Seufert S, Anand A, Bedathur S, Weikum, G.: Ferrari, (2013) Flexible and efficient reachability range assignment for graph indexing. pp 1009\u20131020","DOI":"10.1109\/ICDE.2013.6544893"},{"issue":"1","key":"851_CR20","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/1672308.1672329","volume":"40","author":"J Tang","year":"2010","unstructured":"Tang J, Musolesi M, Mascolo C, Latora V (2010) Characterising temporal distance and reachability in mobile and online social networks. SIGCOMM Comput Commun Rev 40(1):118\u2013124","journal-title":"SIGCOMM Comput Commun Rev"},{"issue":"1","key":"851_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-017-0468-3","volume":"27","author":"H Wei","year":"2018","unstructured":"Wei H, Yu JX, Lu C, Jin R (2018) Reachability querying: an independent permutation labeling approach. VLDB J 27(1):1\u201326","journal-title":"VLDB J"},{"key":"851_CR22","doi-asserted-by":"crossref","unstructured":"Whitbeck, J., Dias\u00a0de Amorim, M., Conan, V., Guillaume, J.L.: Temporal reachability graphs. In: Proceedings of the 18th Annual International Conference on Mobile Computing and Networking, Mobicom \u201912, p. 377\u2013388. Association for Computing Machinery, New York, NY, USA (2012)","DOI":"10.1145\/2348543.2348589"},{"issue":"6","key":"851_CR23","doi-asserted-by":"publisher","first-page":"160196","DOI":"10.1098\/rsos.160196","volume":"3","author":"MJ Williams","year":"2016","unstructured":"Williams MJ, Musolesi M (2016) Spatio-temporal networks: reachability, centrality and robustness. R Soc Open Sci 3(6):160196","journal-title":"R Soc Open Sci"},{"key":"851_CR24","doi-asserted-by":"crossref","unstructured":"Wu G, Ding Y, Li Y, Bao J, Zheng Y, Luo J (2017) Mining spatio-temporal reachable regions over massive trajectory data. pp 1283\u20131294","DOI":"10.1109\/ICDE.2017.171"},{"key":"851_CR25","doi-asserted-by":"crossref","unstructured":"Wu H, Huang Y, Cheng J, Li J, Ke Y (2016) Reachability and time-based path queries in temporal graphs. pp 145\u2013156","DOI":"10.1109\/ICDE.2016.7498236"},{"key":"851_CR26","doi-asserted-by":"crossref","unstructured":"Xiao H, Aslay C, Gionis A (2018) Robust cascade reconstruction by Steiner tree sampling. pp 637\u2013646","DOI":"10.1109\/ICDM.2018.00079"},{"key":"851_CR27","doi-asserted-by":"crossref","unstructured":"Xiao, H., Rozenshtein, P., Tatti, N., Gionis, A.: Reconstructing a cascade from temporal observations, pp. 666\u2013674","DOI":"10.1137\/1.9781611975321.75"},{"issue":"02","key":"851_CR28","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BB Xuan","year":"2003","unstructured":"Xuan BB, Ferreira A, Jarry A (2003) Computing shortest, fastest, and foremost journeys in dynamic networks. Int J Found Computer Sci 14(02):267\u2013285","journal-title":"Int J Found Computer Sci"},{"issue":"12","key":"851_CR29","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1109\/TVCG.2014.2346893","volume":"20","author":"W Zeng","year":"2014","unstructured":"Zeng W, Fu C, Arisona SM, Erath A, Qu H (2014) Visualizing mobility of public transportation system. IEEE Trans Visual Computer Gr 20(12):1833\u20131842","journal-title":"IEEE Trans Visual Computer Gr"},{"key":"851_CR30","doi-asserted-by":"crossref","unstructured":"Zhu AD, Lin W, Wang S, Xiao X (2014). Reachability queries on large dynamic graphs: a total order approach, vol \u201914. Association for Computing Machinery, New York, NY, USA, pp 1323\u20131334","DOI":"10.1145\/2588555.2612181"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00851-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00851-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00851-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T13:40:14Z","timestamp":1672666814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00851-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,23]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["851"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00851-y","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2021,12,23]]},"assertion":[{"value":"26 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"22"}}