{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:13:10Z","timestamp":1742983990208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031814037"},{"type":"electronic","value":"9783031814044"}],"license":[{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"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-3-031-81404-4_13","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:38:10Z","timestamp":1735605490000},"page":"162-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Source Sets in\u00a0Temporal Graphs"],"prefix":"10.1007","author":[{"given":"Saksham","family":"Yadav","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7438-6952","authenticated-orcid":false,"given":"Srinibas","family":"Swain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0957-492X","authenticated-orcid":false,"given":"Subhrangsu","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,31]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-021-00851-y","volume":"12","author":"LF Brito","year":"2022","unstructured":"Brito, L.F., Albertini, M.K., Casteigts, A., Traven\u00e7olo, B.A.: A dynamic data structure for temporal reachability with unsorted contact insertions. Soc. Netw. Anal. Min. 12(1), 1\u201312 (2022)","journal-title":"Soc. Netw. Anal. Min."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Corsini, T., Sarkar, W.: Simple, strict, proper, happy: a study of reachability in temporal graphs. In: International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 3\u201318 (2022)","DOI":"10.1007\/978-3-031-21017-4_1"},{"key":"13_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114434","volume":"991","author":"A Casteigts","year":"2024","unstructured":"Casteigts, A., Corsini, T., Sarkar, W.: Simple, strict, proper, happy: a study of reachability in temporal graphs. Theoret. Comput. Sci. 991, 114434 (2024)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"13_CR4","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.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"9","key":"13_CR5","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Himmel, A.S., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. Algorithmica 83(9), 2754\u20132802 (2021)","journal-title":"Algorithmica"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Danda, U.S., Ramakrishna, G., Schmidt, J.M., Srikanth, M.: On short fastest paths in temporal graphs. In: International Workshop on Algorithms and Computation (WALCOM), pp. 40\u201351 (2021)","DOI":"10.1007\/978-3-030-68211-8_4"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Deligkas, A., Potapov, I.: Optimizing reachability sets in temporal graphs by delaying. Inf. Comput. 104890 (2022)","DOI":"10.1016\/j.ic.2022.104890"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.jcss.2020.08.001","volume":"115","author":"J Enright","year":"2021","unstructured":"Enright, J., Meeks, K., Skerman, F.: Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci. 115, 169\u2013186 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Ferrati, M., Pallottino, L.: A time expanded network based algorithm for safe and efficient distributed multi-agent coordination. In: IEEE Conference on Decision and Control (IEEE CDC), pp. 2805\u20132810 (2013)","DOI":"10.1109\/CDC.2013.6760308"},{"key":"13_CR10","unstructured":"Ferreira, A.: On models and algorithms for dynamic communication networks: the case for evolving graphs. In: $$4^{e}$$ Rencontres Francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL), pp. 155\u2013161 (2002)"},{"key":"13_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, W. H (1979)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"George, B., Shekhar, S.: Time-aggregated graphs for modeling spatio-temporal networks. In: Journal on Data Semantics XI, pp. 191\u2013212 (2008)","DOI":"10.1007\/978-3-540-92148-6_7"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: ACM Symposium on Theory of Computing (STOC), pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Mandal, S., Gupta, A.: Approximation algorithms for permanent dominating set problem on dynamic networks. In: International Conference on Distributed Computing and Internet Technology (ICDCIT), pp. 265\u2013279 (2018)","DOI":"10.1007\/978-3-319-72344-0_22"},{"issue":"03","key":"13_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S012905412050015X","volume":"31","author":"S Mandal","year":"2020","unstructured":"Mandal, S., Gupta, A.: Convergecast tree on temporal graphs. Int. J. Found. Comput. Sci. 31(03), 385\u2013409 (2020)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.dam.2021.12.027","volume":"319","author":"S Mandal","year":"2022","unstructured":"Mandal, S., Gupta, A.: Maximum 0\u20131 timed matching on temporal graphs. Discret. Appl. Math. 319, 310\u2013326 (2022)","journal-title":"Discret. Appl. Math."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Naming and counting in anonymous unknown dynamic networks. In: Symposium on Self-Stabilizing Systems (SSS), pp. 281\u2013295 (2013)","DOI":"10.1007\/978-3-319-03089-0_20"},{"key":"13_CR18","unstructured":"Molter, H., Renken, M., Zschoche, P.: Temporal reachability minimization: delaying vs. deleting. In: International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 76:1\u201376:15 (2021)"},{"key":"13_CR19","unstructured":"Thejaswi, S., Lauri, J., Gionis, A.: Restless reachability problems in temporal graphs. arXiv preprint arXiv:2010.08423 (2020)"},{"issue":"4","key":"13_CR20","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s41019-019-00105-0","volume":"4","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yuan, Y., Ma, Y., Wang, G.: Time-dependent graphs: definitions, applications, and algorithms. Data Sci. Eng. 4(4), 352\u2013366 (2019)","journal-title":"Data Sci. Eng."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Whitbeck, J., Dias\u00a0de Amorim, M., Conan, V., Guillaume, J.L.: Temporal reachability graphs. In: International Conference on Mobile Computing and Networking (MOBICOM), pp. 377\u2013388 (2012)","DOI":"10.1145\/2348543.2348589"},{"issue":"9","key":"13_CR22","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endowm. 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endowm."},{"key":"13_CR23","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: IEEE International Conference on Data Engineering (ICDE), pp. 145\u2013156 (2016)","DOI":"10.1109\/ICDE.2016.7498236"},{"issue":"02","key":"13_CR24","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."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81404-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T01:03:58Z","timestamp":1735607038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81404-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,31]]},"ISBN":["9783031814037","9783031814044"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81404-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,31]]},"assertion":[{"value":"31 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}