{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:05:47Z","timestamp":1725937547401},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720494"},{"type":"electronic","value":"9783319720500"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72050-0_19","type":"book-chapter","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T16:57:13Z","timestamp":1514566633000},"page":"321-338","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Casteigts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yessin M.","family":"Neggaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph G.","family":"Peters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,30]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-12340-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Aaron","year":"2014","unstructured":"Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 29\u201341. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_3"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 278\u2013281. ACM (1984)","DOI":"10.1145\/800222.806754"},{"key":"19_CR3","unstructured":"Barjon, M., Casteigts, A., Chaumette, S., Johnen, C., Neggaz, Y.M.: Testing temporal connectivity in sparse dynamic graphs. CoRR abs\/1404.7634 (2014). (A French version appeared in Proceedings of ALGOTEL 2014)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-49259-9_5","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Bournat","year":"2016","unstructured":"Bournat, M., Datta, A.K., Dubois, S.: Self-stabilizing robots in highly dynamic environments. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 54\u201369. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_5"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ic.2016.12.004","volume":"255","author":"Q Bramas","year":"2017","unstructured":"Bramas, Q., Tixeuil, S.: The complexity of data aggregation in static and dynamic wireless sensor networks. Inf. Comput. 255, 369\u2013383 (2017)","journal-title":"Inf. Comput."},{"issue":"1","key":"19_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.15803\/ijnc.6.1_27","volume":"6","author":"N Braud-Santoni","year":"2016","unstructured":"Braud-Santoni, N., Dubois, S., Kaaouachi, M.H., 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."},{"issue":"2","key":"19_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. of Found. Comput. Sci. 14(2), 267\u2013285 (2003)","journal-title":"Int. J. of Found. Comput. Sci."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","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.) SIROCCO 2009. LNCS, vol. 5869, pp. 126\u2013140. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11476-2_11 . Full version in CoRR, abs\/1102.5529"},{"issue":"2","key":"19_CR9","doi-asserted-by":"crossref","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. Comput. 63(2), 397\u2013410 (2014)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"19_CR10","doi-asserted-by":"crossref","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."},{"issue":"5","key":"19_CR11","doi-asserted-by":"crossref","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":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-18173-8_6","volume-title":"Algorithms and Complexity","author":"A Casteigts","year":"2015","unstructured":"Casteigts, A., Klasing, R., Neggaz, Y.M., Peters, J.G.: Efficiently testing $$T$$ -interval connectivity in dynamic graphs. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 89\u2013100. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_6"},{"key":"19_CR13","unstructured":"Casteigts, A., Klasing, R., Neggaz, Y.M., Peters, J.G.: Calcul de Param\u00e8tres Minimaux dans les Graphes Dynamiques. In: 19\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques de T\u00e9l\u00e9communications (ALGOTEL) (2017)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-21741-3_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Dubois","year":"2015","unstructured":"Dubois, S., Kaaouachi, M.-H., Petit, F.: Enabling minimal dominating set in highly dynamic distributed systems. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 51\u201366. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21741-3_4"},{"key":"19_CR15","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 469, 53\u201368 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR16","volume-title":"Efficient Parallel Algorithms","author":"A Gibbons","year":"1988","unstructured":"Gibbons, A., Rytter, W.: Efficient Parallel Algorithms. Cambridge University Press, Cambridge (1988)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-662-46018-4_6","volume-title":"Algorithms for Sensor Systems","author":"E Godard","year":"2015","unstructured":"Godard, E., Mazauric, D.: Computing the dynamic diameter of non-deterministic dynamic networks is hard. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014. LNCS, vol. 8847, pp. 88\u2013102. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46018-4_6"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proceedings of SIGCOMM, pp. 145\u2013158 (2004)","DOI":"10.1145\/1030194.1015484"},{"key":"19_CR19","volume-title":"An Introduction to Parallel Algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Boston (1992)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of STOC, pp. 513\u2013522. ACM (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of DIALM-POMC, pp. 104\u2013110. ACM (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Raynal, M., Stainer, J., Cao, J., Wu, W.: A simple broadcast algorithm for recurrent dynamic systems. In: 2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA), pp. 933\u2013939. IEEE (2014)","DOI":"10.1109\/AINA.2014.115"},{"key":"19_CR23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theor. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Whitbeck, J., Dias de Amorim, M., Conan, V., Guillaume, J.L.: Temporal reachability graphs. In: Proceedings of MOBICOM, pp. 377\u2013388. ACM (2012)","DOI":"10.1145\/2348543.2348589"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72050-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T21:21:59Z","timestamp":1570569719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72050-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319720494","9783319720500"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72050-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}