{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T15:35:12Z","timestamp":1791214512631,"version":"4.1.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,5,22]],"date-time":"2011-05-22T00:00:00Z","timestamp":1306022400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s00446-011-0133-9","type":"journal-article","created":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T17:34:47Z","timestamp":1305999287000},"page":"31-44","source":"Crossref","is-referenced-by-count":31,"title":["Parsimonious flooding in dynamic graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Herv\u00e9","family":"Baumann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierluigi","family":"Crescenzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,5,22]]},"reference":[{"key":"133_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon N., Spencer J.H.: The Probabilistic Method. Wiley, Colorado (2000)"},{"key":"133_CR2","doi-asserted-by":"crossref","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world. In: Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP), pp. 121\u2013132 (2008)","DOI":"10.1007\/978-3-540-70575-8_11"},{"key":"133_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"key":"133_CR4","doi-asserted-by":"crossref","unstructured":"Brauer, F., van den Driessche, P., Wu, J. (Eds): Mathematical epidemiology. Lecture Notes in Mathematics (Mathematical Biosciences Subseries) 1945, (2008)","DOI":"10.1007\/978-3-540-78911-6"},{"key":"133_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Leskovec, J., Faloutsos, C., Madden, S., Guestrin, C., Faloutsos, M.: Information survival threshold in sensor and P2P networks. In: Proceedings of 26th IEEE Conference on Computer Communications (INFOCOM), pp. 1316\u20131324 (2007)","DOI":"10.1109\/INFCOM.2007.156"},{"issue":"2","key":"133_CR6","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/TNET.2007.892880","volume":"15","author":"N. Chang","year":"2007","unstructured":"Chang N., Liu M.: Controlled flooding search in a large network. IEEE\/ACM Trans. Netw. 15(2), 436\u2013449 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"133_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F. Chung","year":"2001","unstructured":"Chung F., Lu L.: The diameter of sparse random graphs. Adv. Appl. Math. 26(4), 257\u2013279 (2001)","journal-title":"Adv. Appl. Math."},{"issue":"4","key":"133_CR8","doi-asserted-by":"crossref","first-page":"1694","DOI":"10.1137\/090756053","volume":"24","author":"A. Clementi","year":"2010","unstructured":"Clementi A., Macci C., Monti A., Pasquale F., Silvestri R.: Flooding time in edge-Markovian dynamic graphs. SIAM J. Discret. Math. 24(4), 1694\u20131712 (2010)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"133_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.jcss.2008.10.004","volume":"75","author":"A. Clementi","year":"2009","unstructured":"Clementi A., Monti A., Pasquale F., Silvestri R.: Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4), 213\u2013230 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"133_CR10","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Information spreading in stationary Markovian evolving graphs. In: Proceedings of 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1\u201312 (2009)","DOI":"10.1109\/IPDPS.2009.5160986"},{"key":"133_CR11","doi-asserted-by":"crossref","unstructured":"Clementi, A., Pasquale, F., Silvestri, R.: MANETS: High mobility can make up for low transmission power. In: Proceedings of 36th International Colloquium on Automata, Languages and Programming (ICALP), pp. 387\u2013398 (2009)","DOI":"10.1007\/978-3-642-02930-1_32"},{"issue":"1","key":"133_CR12","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/43921.43922","volume":"22","author":"A. Demers","year":"1988","unstructured":"Demers A., Greene D., Hauser C., Irish W., Larson J., Shenker S., Sturgis H., Swinehart D., Terry D.: Epidemic algorithms for replicated database maintenance. Oper. Syst. Rev. 22(1), 8\u201332 (1988)","journal-title":"Oper. Syst. Rev."},{"issue":"2","key":"133_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1214\/07-AAP470","volume":"18","author":"M. Draief","year":"2008","unstructured":"Draief M., Ganesh A., Massouli\u00e9 L.: Thresholds for virus spread on networks. Ann. Appl. Probab. 18(2), 359\u2013378 (2008)","journal-title":"Ann. Appl. Probab."},{"issue":"4","key":"133_CR14","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"Feige U., Peleg D., Raghavan P., Upfal E.: Randomized broadcast in networks. Random Struct. Alg. 1(4), 447\u2013460 (1990)","journal-title":"Random Struct. Alg."},{"key":"133_CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"Fraigniaud P., Lazard E.: Methods and problems of communication in usual networks. Discret. Appl. Math. 53, 79\u2013133 (1994)","journal-title":"Discret. Appl. Math."},{"key":"133_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A. Frieze","year":"1985","unstructured":"Frieze A., Grimmett G.: The shortest-path problem for graphs with random arc-lengths. Discret. Appl. Math. 10, 57\u201377 (1985)","journal-title":"Discret. Appl. Math."},{"key":"133_CR17","unstructured":"Gnutella RFC. http:\/\/rfc-gnutella.sourceforge.net\/"},{"issue":"4","key":"133_CR18","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TNET.2002.801403","volume":"10","author":"M. Grossglauser","year":"2002","unstructured":"Grossglauser M., Tse D.: Mobility increases the capacity of ad-hoc wireless networks. IEEE\/ACM Trans. Netw. 10(4), 477\u2013486 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"7","key":"133_CR19","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/TPDS.2006.85","volume":"17","author":"I. Gupta","year":"2006","unstructured":"Gupta I., Kermarrec A.-M., Ganesh A.: Efficient and adaptive epidemic-style protocols for reliable and scalable multicast. IEEE Trans. Parallel Dist. Syst. 17(7), 593\u2013605 (2006)","journal-title":"IEEE Trans. Parallel Dist. Syst."},{"key":"133_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. Hedetniemi","year":"1986","unstructured":"Hedetniemi S., Hedetniemi S., Liestman A.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319\u2013349 (1986)","journal-title":"Networks"},{"key":"133_CR21","first-page":"125","volume-title":"Combinatorial Network Theory","author":"J. Hromkovi\u0107","year":"1995","unstructured":"Hromkovi\u0107 J., Klasing R., Monien B., Peine R.: Dissemination of information in interconnection networks (broadcasting and gossiping). In: Du, D.-Z., Hsu, D. (eds) Combinatorial Network Theory, pp. 125\u2013212. Kluwer Academic, Dordrecht (1995)"},{"key":"133_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson S., Luczak T., Rucinski A.: Random Graphs. Wiley, Dordrecht (2000)"},{"key":"133_CR23","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Computing aggregate information using gossip. In: Proceedings of 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482\u2013491 (2003)"},{"issue":"6","key":"133_CR24","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1145\/1039488.1039491","volume":"51","author":"D. Kempe","year":"2004","unstructured":"Kempe D., Kleinberg J., Demers A.: Spatial gossip and resource location protocols. J. ACM 51(6), 943\u2013967 (2004)","journal-title":"J. ACM"},{"key":"133_CR25","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.: Protocols and impossibility results for gossip-based communication mechanisms. In: Proceedings of 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 471\u2013480 (2002)","DOI":"10.1109\/SFCS.2002.1181971"},{"key":"133_CR26","doi-asserted-by":"crossref","unstructured":"Luo, J., Eugster, P., Hubaux, J.-P.: Route driven gossip: probabilistic reliable multicast in ad hoc networks. In: Proceedings of 22nd IEEE Conference on Computer Communications (INFOCOM), pp. 2229\u20132239 (2003)","DOI":"10.1109\/INFCOM.2003.1209243"},{"key":"133_CR27","doi-asserted-by":"crossref","unstructured":"Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of 16th ACM International Conference on Supercomputing (ICS), pp. 84\u201395 (2002)","DOI":"10.1145\/514191.514206"},{"key":"133_CR28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"Pittel B.: On spreading a rumour. SIAM J. Appl. Math. 47, 213\u2013223 (1987)","journal-title":"SIAM J. Appl. Math."},{"key":"133_CR29","doi-asserted-by":"crossref","unstructured":"Sarwate, A., Dimakis, A.: The impact of mobility on gossip algorithms. In: Proceedings of 28th IEEE Conference on Computer Communications (INFOCOM), pp. 2088\u20132096 (2009)","DOI":"10.1109\/INFCOM.2009.5062132"},{"key":"133_CR30","doi-asserted-by":"crossref","unstructured":"Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: Proceedings of 22nd IEEE Conference on Computer Communications (INFOCOM), pp. 2166\u20132176 (2003)","DOI":"10.1109\/INFCOM.2003.1209237"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0133-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-011-0133-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0133-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T19:04:53Z","timestamp":1741201493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-011-0133-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,22]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s00446-011-0133-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,22]]}}}