{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:13:22Z","timestamp":1759364002520,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032003461","type":"print"},{"value":"9783032003478","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"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-3-032-00347-8_3","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:59:22Z","timestamp":1759276762000},"page":"39-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Computation of\u00a0Temporal Twins in\u00a0Periodic Undirected Time-Varying Graphs"],"prefix":"10.1007","author":[{"given":"Massinissa","family":"Tighilt","sequence":"first","affiliation":[]},{"given":"Lina","family":"Azerouk","sequence":"additional","affiliation":[]},{"given":"Camille","family":"Palisoc","sequence":"additional","affiliation":[]},{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Addanki, V., Avin, C., Schmid, S.: Mars: Near-optimal throughput with shallow buffers in reconfigurable datacenter networks. Proc. ACM Meas. Anal. Comput. Syst. 7(1), 2:1\u20132:43 (2023). https:\/\/doi.org\/10.1145\/3579312, https:\/\/doi.org\/10.1145\/3579312","DOI":"10.1145\/3579312"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Ballani, H., et al.: Sirius: a flat datacenter network with nanosecond optical switching. In: Schulzrinne, H., Misra, V. (eds.) Proceedings of the Conference of the ACM Special Interest Group on Data Communication, SIGCOMM, 2020, pp. 782\u2013797. ACM (2020). https:\/\/doi.org\/10.1145\/3387514.3406221, https:\/\/doi.org\/10.1145\/3387514.3406221","DOI":"10.1145\/3387514.3406221"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/S13174-012-0073-Z","volume":"3","author":"S Bhadra","year":"2012","unstructured":"Bhadra, S., Ferreira, A.: Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs. J. Internet Serv. Appl. 3(3), 269\u2013275 (2012). https:\/\/doi.org\/10.1007\/S13174-012-0073-Z","journal-title":"J. Internet Serv. Appl."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bonnet, E., Kim, E., Thomass\u00e9, S., Watrigant, R.: Twin-width I: tractable FO model checking. In: 61st IEEE Annual Symposium on Foundations of Computer Science, pp. 601\u2013612. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00062"},{"issue":"1","key":"3_CR5","first-page":"27","volume":"6","author":"N Braud-Santoni","year":"2016","unstructured":"Braud-Santoni, N., Dubois, S., Kaaouachi, M., Petit, F.: The next 700 impossibility results in time-varying graphs. Int. J. Netw. Comput. 6(1), 27\u201341 (2016)","journal-title":"Int. J. Netw. Comput."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bui-Xuan, B., Hourcade, H., Miachon, C.: Computing temporal twins in time logarithmic in history length. In: 9th International Conference on Complex Networks and their Applications. SCI, vol.\u00a0944, pp. 651\u2013663 (2020)","DOI":"10.1007\/978-3-030-65351-4_52"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-11476-2_11","volume-title":"Structural Information and Communication Complexity","author":"A Casteigts","year":"2010","unstructured":"Casteigts, A., Chaumette, S., Ferreira, A.: Characterizing topological assumptions of distributed algorithms in dynamic networks. In: Kutten, S., \u017derovnik, J. (eds.) Structural Information and Communication Complexity, pp. 126\u2013140. Springer, Berlin Heidelberg, Berlin, Heidelberg (2010)"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TC.2012.208","volume":"63","author":"A Casteigts","year":"2014","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Measuring temporal lags in delay-tolerant networks. IEEE Trans. Computers 63(2), 397\u2013410 (2014)","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"3_CR9","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."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.tcs.2019.08.008","volume":"806","author":"A Casteigts","year":"2020","unstructured":"Casteigts, A., Dubois, S., Petit, F., Robson, J.M.: Robustness: a new form of heredity motivated by dynamic networks. Theor. Comput. Sci. 806, 429\u2013445 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2015.04.004","volume":"590","author":"A Casteigts","year":"2015","unstructured":"Casteigts, A., Flocchini, P., Godard, E., Santoro, N., Yamashita, M.: On the expressivity of time-varying graphs. Theor. Comput. Sci. 590, 27\u201337 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1142\/S0129054115500288","volume":"26","author":"A Casteigts","year":"2015","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Shortest, fastest, and foremost broadcast in dynamic networks. Int. J. Found. Comput. Sci. 26(4), 499\u2013522 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures: a framework for decomposition and transformation of graphs. World Scientific (1999)","DOI":"10.1142\/4197"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/J.TCS.2012.10.029","volume":"469","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theoret. Comput. Sci. 469, 53\u201368 (2013). https:\/\/doi.org\/10.1016\/J.TCS.2012.10.029","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae 18, 25\u201366 (1967)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"3_CR16","unstructured":"Habib, M., Mouatadid, L., Sopena, E., Zou, M.: $$(\\alpha ,\\beta )$$-modules in graphs. CoRR abs\/2101.08881 (2021). https:\/\/arxiv.org\/abs\/2101.08881"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-030-39219-2_5","volume-title":"Algorithms and Discrete Applied Mathematics","author":"M Habib","year":"2020","unstructured":"Habib, M., Mouatadid, L., Zou, M.: Approximating Modular Decomposition Is Hard. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 53\u201366. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_5"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M., Nolin, A., Tonoyan, T.: Overcoming congestion in distributed coloring. In: 2022 ACM Symposium on Principles of Distributed Computing, pp. 26\u201336. ACM (2022)","DOI":"10.1145\/3519270.3538438"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: 42nd ACM Symposium on Theory of Computing, pp. 513\u2013522. ACM (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"5","key":"3_CR21","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TVCG.2006.193","volume":"12","author":"G Kumar","year":"2006","unstructured":"Kumar, G., Garland, M.: Visual exploration of complex time-varying graphs. IEEE Trans. Visual Comput. Graphics 12(5), 805\u2013812 (2006). https:\/\/doi.org\/10.1109\/TVCG.2006.193","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Luna, G.D., Viglietta, G.: Computing in anonymous dynamic networks is linear. In: 63rd Annual Symposium on Foundations of Computer Science, pp. 1122\u20131133. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00108"},{"key":"3_CR23","unstructured":"Luna, G.A.D., Viglietta, G.: Efficient computation in congested anonymous dynamic networks. In: Kr\u00e1lovic, R., Kucera, A. (eds.) 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, August 26-30, 2024, Bratislava, Slovakia. LIPIcs, vol.\u00a0306, pp. 49:1\u201349:19"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Luna, G.A.D., Viglietta, G.: Computing in anonymous dynamic networks is linear. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pp. 1122\u20131133. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00108"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Mellette, W., et al.: A scalable, low-complexity, optical datacenter network. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, SIGCOMM, 2017, pp. 267\u2013280. ACM (2017). https:\/\/doi.org\/10.1145\/3098822.3098838, https:\/\/doi.org\/10.1145\/3098822.3098838","DOI":"10.1145\/3098822.3098838"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Mengxiang Liu, M., Teng, F., Zhang, Z., Ge, P., Sun, M., Deng, R., Cheng, P., Chen, J.: Enhancing cyber-resiliency of der-based smart grid: a survey. IEEE Trans. Smart Grid 15(5), 4998\u20135030 (2024). https:\/\/doi.org\/10.1109\/TSG.2024.3373008","DOI":"10.1109\/TSG.2024.3373008"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Natali, A., Isufi, E., Coutino, M., Leus, G.: Learning time-varying graphs from online data. IEEE Open J. Signal Process. 3, 212\u2013228 (2022). https:\/\/doi.org\/10.1109\/OJSP.2022.3178901","DOI":"10.1109\/OJSP.2022.3178901"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TAC.2014.2364096","volume":"60","author":"A Nedi\u0107","year":"2015","unstructured":"Nedi\u0107, A., Olshevsky, A.: Distributed optimization over time-varying directed graphs. IEEE Trans. Autom. Control 60(3), 601\u2013615 (2015). https:\/\/doi.org\/10.1109\/TAC.2014.2364096","journal-title":"IEEE Trans. Autom. Control"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pp. 104\u2013110. ACM (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22, 349\u2013361 (2010). https:\/\/doi.org\/10.1007\/s00446-010-0097-1","DOI":"10.1007\/s00446-010-0097-1"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Tang, J., Scellato, S., Musolesi, M., Mascolo, C., Latora, V.: Small-world behavior in time-varying graphs. Phys. Rev. E 81, 055101 (2010). https:\/\/doi.org\/10.1103\/PhysRevE.81.055101","DOI":"10.1103\/PhysRevE.81.055101"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Wehmuth, K., Ziviani, A., Fleury, E.: A unifying model for representing time-varying graphs. In: 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), pp. 1\u201310 (2015). https:\/\/doi.org\/10.1109\/DSAA.2015.7344810","DOI":"10.1109\/DSAA.2015.7344810"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Whitbeck, J., Dias\u00a0de Amorim, M., Conan, V., Guillaume, J.: Temporal reachability graphs. In: Akan, \u00d6.B., Ekici, E., Qiu, L., Snoeren, A.C. (eds.) The 18th Annual International Conference on Mobile Computing and Networking, Mobicom\u201912, Istanbul, Turkey, August 22-26, 2012, pp. 377\u2013388. ACM (2012https:\/\/doi.org\/10.1145\/2348543.2348589","DOI":"10.1145\/2348543.2348589"},{"issue":"2","key":"3_CR34","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/MNET.001.1900245","volume":"34","author":"T Zhang","year":"2020","unstructured":"Zhang, T., et al.: Application of time-varying graph theory over the space information networks. IEEE Netw. 34(2), 179\u2013185 (2020). https:\/\/doi.org\/10.1109\/MNET.001.1900245","journal-title":"IEEE Netw."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00347-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:59:27Z","timestamp":1759276767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00347-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032003461","9783032003478"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00347-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"21 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/netys.net","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}